Ajax: Fast Threshold Fully Homomorphic Encryption without Noise Flooding
Zhenkai Hu, Haofei Liang, Xiao Wang, Xiang Xie, Kang Yang, Yu Yu, Wenhao Zhang
摘要
Threshold fully homomorphic encryption (ThFHE) enables multiple parties to perform arbitrary computation over encrypted data, while the secret key is distributed across the parties. The main task of designing ThFHE is to construct threshold key-generation and decryption protocols for FHE schemes. Among existing FHE schemes, FHEW-like cryptosystems enjoy the advantage of fast bootstrapping and small parameters. However, known ThFHE solutions use the "noise-flooding" technique to realize threshold decryption, which requires either large parameters or switching to a scheme with large parameters via bootstrapping, leading to a slow decryption process. Besides, for key generation, existing ThFHE schemes either assume a generic MPC or a trusted setup, or incur noise growth that is linear in the number n of parties. In this paper, we propose a fast ThFHE scheme Ajax, by designing threshold key-generation and decryption protocols for FHEW-like cryptosystems. In particular, for threshold decryption, we eliminate the need for noise flooding, and instead present a new technique called "mask-then-open" based on random double sharings over different rings, while keeping the advantage of small parameters. For threshold key generation, we show a simple approach to reduce the noise growth from n times to max(0.038n,2) times in the honest-majority setting, where at most t=(n-1)/2 parties are corrupted. Our end-to-end implementation reports the running time 17.6 s and 0.9 ms (resp., 91.9 s and 4.4 ms) of generating a set of keys and decrypting a single ciphertext respectively, for n=3 (resp., n=21) parties under the network of 1 Gbps bandwidth and 1 ms ping time. Compared to the state-of-the-art implementation, our protocol improves the end-to-end performance of the threshold decryption protocol by a factor of at least 5.7× 283.6× across different network latencies from t=1 to t=13. Our approaches can also be applied in other types of FHE schemes like BGV, BFV, and CKKS.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Relect: Single Secret Leader Election via FHE with Reduced Computation and Communication and Transparent SetupHaofei Liang, Zeyu Liu, Yunhao Wang, Xiang Xie 等CCS 2026
- Revisiting Shamir Secret Sharing for Threshold Fully Homomorphic EncryptionJiseung Kim, Seunghu Kim, Hyung Tae LeeCCS 2026
它引用的顶会 Paper17
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious TransferMarcel Keller, Emmanuela Orsini, Peter SchollCCS 2016 · 被引用 487 次
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CCS 2019 · 被引用 238 次
- Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic EncryptionYongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi 等EUROCRYPT 2023 · 被引用 86 次
- Correlated Pseudorandomness from Expand-Accumulate CodesElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CRYPTO 2022 · 被引用 66 次
- Expand-Convolute Codes for Pseudorandom Correlation Generators from LPNSrinivasan Raghuraman, Peter Rindal, Titouan TanguyCRYPTO 2023 · 被引用 50 次
相关 Paper
- High-Throughput Universally Composable Threshold FHE DecryptionGuy Zyskind, Doron Zarchy, Max Leibovich, Chris PeikertCCS 2025
- HERDS: Multi-key Fully Homomorphic Encryption with Sublinear BootstrappingBinwu Xiang, Seonhong Min, Intak Hwang, Zhiwei Wang 等EUROCRYPT 2026 · 被引用 1 次
- BTS: an accelerator for bootstrappable fully homomorphic encryptionSangpyo Kim, Jongmin Kim, Michael Jaemin Kim, Wonkyung Jung 等ISCA 2022 · 被引用 184 次
- Distributed Key Generation for Efficient Threshold-CKKSSeonhong Min, Guillaume Hanrot, Jai Hyun Park, Alain Passelègue 等CCS 2026 · 被引用 1 次
- Arbitrary-Threshold Fully Homomorphic Encryption with Lower ComplexityYijia Chang, Songze LiUSENIX Security 2025
