High-Precision Bootstrapping of RNS-CKKS Homomorphic Encryption Using Optimal Minimax Polynomial Approximation and Inverse Sine Function
Joon-Woo Lee, Eunsang Lee, Yongwoo Lee, Young-Sik Kim, Jong-Seon No
摘要
Approximate homomorphic encryption with the residue number system (RNS), called RNS-variant Cheon-Kim-Kim-Song (RNS-CKKS) scheme, is a fully homomorphic encryption scheme that supports arithmetic operations for real or complex number data encrypted. Although the RNS-CKKS scheme is a fully homomorphic encryption scheme, most of the applications with the RNS-CKKS scheme use it as the only leveled homomorphic encryption scheme because of the lack of the practicality of the bootstrapping operation of the RNS-CKKS scheme. One of the crucial problems of the bootstrapping operation is its poor precision. While other basic homomorphic operations ensure sufficiently high precision for practical use, the bootstrapping operation only supports about 20-bit fixed-point precision at best, which is not high precision enough to be used for the reliable large-depth homomorphic computations until now.
In this paper, we improve the message precision in the bootstrapping operation of the RNS-CKKS scheme. Since the homomorphic modular reduction process is one of the most important steps in determining the precision of the bootstrapping, we focus on the homomorphic modular reduction process. Firstly, we propose a fast algorithm of obtaining the optimal minimax approximate polynomial of modular reduction function and the scaled sine/cosine function over the union of the approximation regions, called an improved multi-interval Remez algorithm. In fact, this algorithm derives the optimal minimax approximate polynomial of any continuous functions over any union of the finite number of intervals. Next, we propose the composite function method using the inverse sine function to reduce the difference between the scaling factor used in the bootstrapping and the default scaling factor. With these methods, we reduce the approximation error in the bootstrapping of the RNS-CKKS scheme by 1/1176 1/42 (5.4 10.2-bit precision improvement) for each parameter setting. While the bootstrapping without the composite function method has 27.2 30.3-bit precision at maximum, the bootstrapping with the composite function method has 32.6 40.5-bit precision.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper14
- BTS: an accelerator for bootstrappable fully homomorphic encryptionSangpyo Kim, Jongmin Kim, Michael Jaemin Kim, Wonkyung Jung 等ISCA 2022 · 被引用 184 次
- ARK: Fully Homomorphic Encryption Accelerator with Runtime Data Generation and Inter-Operation Key ReuseJongmin Kim, Gwangho Lee, Sangpyo Kim, Gina Sohn 等MICRO 2022 · 被引用 160 次
- Poseidon: Practical Homomorphic Encryption AcceleratorYinghao Yang, Huaizhi Zhang, Shengyu Fan, Hang Lu 等HPCA 2023 · 被引用 109 次
- AutoFHE: Automated Adaption of CNNs for Efficient Evaluation over FHEWei Ao, Vishnu Naresh BoddetiUSENIX Security 2024 · 被引用 43 次
- META-BTS: Bootstrapping Precision Beyond the LimitYoungjin Bae, Jung Hee Cheon, Wonhee Cho, Jaehyung Kim 等CCS 2022 · 被引用 36 次
相关 Paper
- High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance MinimizationYongwoo Lee, Joon-Woo Lee, Young-Sik Kim, Yongjune Kim 等EUROCRYPT 2022 · 被引用 67 次
- Improved Radix-Based Approximate Homomorphic Encryption for Large Integers via Lightweight Bootstrapped Digit CarryGyeongwon Cha, Dongjin Park, Joon-Woo LeeEUROCRYPT 2026 · 被引用 10 次
- Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse KeysJean-Philippe Bossuat, Christian Mouchet, Juan Ramón Troncoso-Pastoriza, Jean-Pierre HubauxEUROCRYPT 2021 · 被引用 179 次
- Low-Complexity Deep Convolutional Neural Networks on Fully Homomorphic Encryption Using Multiplexed Parallel ConvolutionsEunsang Lee, Joon-Woo Lee, Junghyun Lee, Young-Sik Kim 等ICML 2022 · 被引用 171 次
- Leveraging Discrete CKKS to Bootstrap in High PrecisionHyeongmin Choe, Jaehyung Kim, Damien Stehlé, Elias SuvantoCCS 2025
