Bootstrapping Optimization for Fully Homomorphic Encryption Schemes
Preprint
- 19 April 2024
- preprint
- Published by Springer Nature in Research Square
Abstract
With the advent of cloud computing and the era of big data, there is an increasing focus on privacy computing. Consequently, homomorphic encryption, being a primary technique for achieving privacy computing, is held in high regard. Nevertheless, the efficiency of homomorphic encryption schemes is significantly impacted by boostrapping. FINAL scheme (ASIACRYPT 2022) is a fully homomorphic encryption scheme based on number theory research unit (NTRU) and learning with errors (LWE) assumptions proposed by Charlotte Bonte et al. The performance of the FINAL scheme is better than TFHE scheme, with a faster bootstrapping and smaller bootstrapping and key-switching keys. In this paper, we introduce ellipsoidal Gaussian sampling to generate the keys f and g in bootstrapping of FINAL scheme, so that the standard deviations of the keys f and g are different and reduce the bootstrapping noise. As a result, larger decomposition bases is used in bootstrapping to reduce the total number of polynomial multiplications, thus improving the efficiency of FINAL scheme. The optimization scheme outperforms the original FINAL scheme with a 33.3\% faster bootstrapping.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE2021
- Efficient Lattice Gadget Decomposition Algorithm With Bounded Uniform DistributionIEEE Access, 2021
- Leakage Resilient Leveled FHE on Multiple Bit MessageIEEE Transactions on Big Data, 2017
- Two Birds with One Stone: Two-Factor Authentication with Security Beyond Conventional BoundIEEE Transactions on Dependable and Secure Computing, 2016
- A Decade of Lattice CryptographyFoundations and Trends® in Theoretical Computer Science, 2016
- Packing Messages and Optimizing Bootstrapping in GSW-FHE2015
- Gaussian Sampling in Lattice Based CryptographyTatra Mountains Mathematical Publications, 2014
- (Leveled) Fully Homomorphic Encryption without BootstrappingACM Transactions on Computation Theory, 2014
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$SIAM Journal on Computing, 2014