Practical bootstrapping in quasilinear time
From MaRDI portal
Publication:2845657
Recommendations
Cited in
(38)- Faster homomorphic linear transformations in HElib
- Bootstrapping for BGV and BFV revisited
- How (not) to instantiate ring-LWE
- Lattice-based SNARGs and their application to more efficient obfuscation
- Bootstrapping BGV ciphertexts with a wider choice of \(p\) and \(q\)
- Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
- Time-lock puzzles from lattices
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Faster bootstrapping of FHE over the integers
- Bootstrapping for helib
- Minimizing the number of bootstrappings in fully homomorphic encryption
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Faster homomorphic permutation and optimizing bootstrapping in matrix GSW-FHE
- FHEW with Efficient Multibit Bootstrapping
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Homomorphic encryption
- Full domain functional bootstrapping with least significant bit encoding
- Survey of information security
- Homomorphic lower digits removal and improved FHE bootstrapping
- Blending FHE-NTRU keys -- the excalibur property
- Bootstrapping for approximate homomorphic encryption
- Faster amortized FHEW bootstrapping using ring automorphisms
- Circuit bootstrapping: faster and smaller
- Private database access with HE-over-ORAM architecture
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Packing messages and optimizing bootstrapping in GSW-FHE
- (In)security of ring-LWE under partial key exposure
- Fully homomorphic encryption for point numbers
- Implementing Gentry's fully-homomorphic encryption scheme
- Ring packing and amortized FHEW bootstrapping
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Faster Bootstrapping with Polynomial Error
- Better bootstrapping in fully homomorphic encryption
- Ring switching in BGV-style homomorphic encryption
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fast blind rotation for bootstrapping FHEs
This page was built for publication: Practical bootstrapping in quasilinear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845657)
