More efficient functional bootstrapping for general functions in polynomial modulus
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A toolkit for ring-LWE cryptography
- Algebraically structured LWE. Revisited
- Algorithms in HElib
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- 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 HElib
- Circuit bootstrapping: faster and smaller
- Classical hardness of learning with errors
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fast blind rotation for bootstrapping FHEs
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- FHEW with Efficient Multibit Bootstrapping
- FHEW: bootstrapping homomorphic encryption in less than a second
- FINAL: faster FHE instantiated with NTRU and LWE
- 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 encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- How (not) to instantiate ring-LWE
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Improved secure integer comparison via homomorphic encryption
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Lattice-based FHE as secure as PKE
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Parameter optimization and larger precision for (T)FHE
- Practical bootstrapping in quasilinear time
- Provably weak instances of ring-LWE revisited
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- TFHE: fast fully homomorphic encryption over the torus
Cited in
(2)
This page was built for publication: More efficient functional bootstrapping for general functions in polynomial modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955270)
