Paper 2025/084
Arbitrary-Threshold Fully Homomorphic Encryption with Lower Complexity
Abstract
Threshold fully homomorphic encryption (ThFHE) enables multiple parties to compute functions over their sensitive data without leaking data privacy. Most of existing ThFHE schemes are restricted to full threshold and require the participation of all parties to output computing results. Compared with these full-threshold schemes, arbitrary threshold (ATh)-FHE schemes are robust to non-participants and can be a promising solution to many real-world applications. However, existing AThFHE schemes are either inefficient to be applied with a large number of parties
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. USENIX Security 2025
- Keywords
- Threshold Fully Homomorphic EncryptionApproximate Secret SharingSecure Multi-Party Computation
- Contact author(s)
-
ychang847 @ connect hkust-gz edu cn
songzeli8824 @ outlook com - History
- 2025-01-29: last of 2 revisions
- 2025-01-20: received
- See all versions
- Short URL
- https://ia.cr/2025/084
- License
-
CC BY-NC-ND
BibTeX
@misc{cryptoeprint:2025/084, author = {Yijia Chang and Songze Li}, title = {Arbitrary-Threshold Fully Homomorphic Encryption with Lower Complexity}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/084}, year = {2025}, url = {https://eprint.iacr.org/2025/084} }