Homomorphic Multiple Precision Multiplication for CKKS and Reduced Modulus Consumption
Jung Hee Cheon, Wonhee Cho, Jaehyung Kim, Damien Stehlé
2023年份
13被引次数
4顶会引用
摘要
Homomorphic Encryption (HE) schemes such as BGV, BFV, and CKKS consume some ciphertext modulus for each multiplication. Bootstrapping (BTS) restores the modulus and allows homomorphic computation to continue, but it is time-consuming and requires a significant amount of modulus. For these reasons, decreasing modulus consumption is crucial topic for BGV, BFV and CKKS, on which numerous studies have been conducted.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper4
- Reliable Non-Leveled Homomorphic Encryption for Web ServicesBaigang Chen, Dongfang ZhaoWWW 2026 · 被引用 1 次
- RBOOT: Accelerating Homomorphic Neural Network Inference by Fusing ReLU within BootstrappingZhaomin Yang, Chao Niu, Benqiang Wei, Zhicong Huang 等USENIX Security 2026 · 被引用 1 次
- Leveraging Discrete CKKS to Bootstrap in High PrecisionHyeongmin Choe, Jaehyung Kim, Damien Stehlé, Elias SuvantoCCS 2025
- Grafting: Decoupled Scale Factors and Modulus in RNS-CKKSJung Hee Cheon, Hyeongmin Choe, Minsik Kang, Jaehyung Kim 等CCS 2025
相关 Paper
- META-BTS: Bootstrapping Precision Beyond the LimitYoungjin Bae, Jung Hee Cheon, Wonhee Cho, Jaehyung Kim 等CCS 2022 · 被引用 36 次
- Simpler and Faster BFV Bootstrapping for Arbitrary Plaintext Modulus from CKKSJaehyung Kim, Jinyeong Seo, Yongsoo SongCCS 2024 · 被引用 16 次
- Batch Bootstrapping II: - Bootstrapping in Polynomial Modulus only Requires Õ(1) FHE Multiplications in AmortizationFeng-Hao Liu, Han WangEUROCRYPT 2023 · 被引用 27 次
- Efficient Bootstrapping in Fully Homomorphic Encryption for Matrix ArithmeticEric Crockett, Craig Gentry, Hyojun Kim, Yeongmin Lee 等CRYPTO 2026
- On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic EncryptionRobin Geelen, Ilia Iliashenko, Jiayi Kang, Frederik VercauterenEUROCRYPT 2023 · 被引用 25 次
