Practical bootstrapping in quasilinear time
From MaRDI portal
Publication:2845657
DOI10.1007/978-3-642-40041-4_1zbMATH Open1310.94122OpenAlexW150064776MaRDI QIDQ2845657FDOQ2845657
Authors: Jacob Alperin-Sheriff, Chris Peikert 
Publication date: 2 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_1
Recommendations
Cited In (35)
- Faster homomorphic permutation and optimizing bootstrapping in matrix GSW-FHE
- Implementing Gentry's fully-homomorphic encryption scheme
- Better bootstrapping in fully homomorphic encryption
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- Ring switching in BGV-style homomorphic encryption
- Ring packing and amortized FHEW bootstrapping
- Bootstrapping BGV ciphertexts with a wider choice of \(p\) and \(q\)
- Full domain functional bootstrapping with least significant bit encoding
- Private database access with HE-over-ORAM architecture
- Bootstrapping for approximate homomorphic encryption
- FHEW: bootstrapping homomorphic encryption in less than a second
- How (not) to instantiate ring-LWE
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Survey of information security
- Packing messages and optimizing bootstrapping in GSW-FHE
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Lattice-based SNARGs and their application to more efficient obfuscation
- Fully homomorphic encryption for point numbers
- 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 lower digits removal and improved FHE bootstrapping
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Bootstrapping for helib
- Homomorphic encryption
- Faster amortized FHEW bootstrapping using ring automorphisms
- Faster bootstrapping of FHE over the integers
- (In)security of ring-LWE under partial key exposure
- Faster Bootstrapping with Polynomial Error
- Bootstrapping for BGV and BFV revisited
- Time-lock puzzles from lattices
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- FHEW with Efficient Multibit Bootstrapping
- Blending FHE-NTRU keys -- the excalibur property
- Faster homomorphic linear transformations in HElib
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
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)
