Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
From MaRDI portal
Publication:6063523
DOI10.1007/978-3-031-30620-4_11zbMath1528.94066MaRDI QIDQ6063523
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Cites Work
- Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
- Large FHE gates from tensored homomorphic accumulator
- Faster homomorphic linear transformations in HElib
- Advances in cryptology -- ASIACRYPT 2017. 23rd international conference on the theory and applications of cryptology and information security, Hong Kong, China, December 3--7, 2017. Proceedings. Part III
- Estimate all the {LWE, NTRU} schemes!
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Algebraically structured LWE. Revisited
- 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
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- How (Not) to Instantiate Ring-LWE
- Practical Bootstrapping in Quasilinear Time
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Better Bootstrapping in Fully Homomorphic Encryption
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Lattice-based FHE as secure as PKE
- On Ideal Lattices and Learning with Errors over Rings
- A Toolkit for Ring-LWE Cryptography
- Pseudorandomness of ring-LWE for any ring and modulus
- Ring Packing and Amortized FHEW Bootstrapping
- Fully homomorphic encryption using ideal lattices
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- FINAL: faster FHE instantiated with NTRU and LWE
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE