Amortized functional bootstrapping in less than 7 ms, with O(1) polynomial multiplications
From MaRDI portal
Publication:6605320
Recommendations
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
- Faster amortized FHEW bootstrapping using ring automorphisms
- Batched fully homomorphic encryption from TFHE
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- 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
- Bootstrapping for approximate homomorphic encryption
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic SIMD operations
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic lower digits removal and improved FHE bootstrapping
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- On the concrete hardness of learning with errors
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Practical bootstrapping in quasilinear time
- Revisiting homomorphic encryption schemes for finite fields
- Ring packing and amortized FHEW bootstrapping
- Ring switching in BGV-style homomorphic encryption
Cited in
(12)- 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
- Batched fully homomorphic encryption from TFHE
- Full domain functional bootstrapping with least significant bit encoding
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Faster amortized FHEW bootstrapping using ring automorphisms
- General functional bootstrapping using CKKS
- More efficient functional bootstrapping for general functions in polynomial modulus
- Bootstrapping small integers with CKKS
- Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
- High-precision functional bootstrapping for CKKS from Fourier extension
- Revisiting the slot-to-coefficient transformation for BGV and BFV
This page was built for publication: Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605320)
