Circuit bootstrapping: faster and smaller
From MaRDI portal
Publication:6636511
DOI10.1007/978-3-031-58723-8_12MaRDI QIDQ6636511
Xianhui Lu, Benqiang Wei, Yundi Wen, Ruida Wang, Kun Liu, Zhihao Li, Kun-Peng Wang
Publication date: 12 November 2024
Nonnumerical algorithms (68W05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Cites Work
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Homomorphic AES evaluation using the modified LTV scheme
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- New techniques for multi-value input homomorphic evaluation and applications
- TFHE: fast fully homomorphic encryption over the torus
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Batch Fully Homomorphic Encryption over the Integers
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
- On lattices, learning with errors, random linear codes, and cryptography
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
This page was built for publication: Circuit bootstrapping: faster and smaller
