Large-plaintext functional bootstrapping in FHE with small bootstrapping keys
From MaRDI portal
Cites work
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- 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
- Circuit bootstrapping: faster and smaller
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Faster amortized FHEW bootstrapping using ring automorphisms
- Faster Bootstrapping with Polynomial Error
- 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
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- More efficient functional bootstrapping for general functions in polynomial modulus
- Protecting privacy through homomorphic encryption. Based on 6 workshops on homomorphic encryption standardization
- TFHE: fast fully homomorphic encryption over the torus
This page was built for publication: Large-plaintext functional bootstrapping in FHE with small bootstrapping keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233178)