Bootstrapping for HElib
From MaRDI portal
Recommendations
Cited in
(47)- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Homomorphic lower digits removal and improved FHE bootstrapping
- Bootstrapping for approximate homomorphic encryption
- Faster homomorphic linear transformations in HElib
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- On the security of homomorphic encryption on approximate numbers
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- Field instruction multiple data
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- Bootstrapping for helib
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Bootstrapping for BGV and BFV revisited
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- FHE circuit privacy almost for free
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Breaking the circuit size barrier for secure computation under DDH
- Practical bootstrapping in quasilinear time
- Algorithms in HElib
- Ring packing and amortized FHEW bootstrapping
- Homomorphic encryption
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- BLEACH: cleaning errors in discrete computations over CKKS
- Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes
- Hybrid dual and meet-LWE attack
- Verifiable Decryption for Fully Homomorphic Encryption
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
- Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
- A BGV-subroutined CKKS bootstrapping algorithm without sine approximation
- Bootstrapping with RMFE for fully homomorphic encryption
- More efficient functional bootstrapping for general functions in polynomial modulus
- Faster BGV bootstrapping for power-of-two cyclotomics through homomorphic NTT
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- Pseudorandom correlation functions from Ring-LWR
- Vive Galois! I: Optimal SIMD packing and packed bootstrapping for FHE
- BitGC made (more) efficient
- Circuit privacy for FHEW/TFHE-style fully homomorphic encryption in practice
- Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM
- (Leveled) fully homomorphic encryption without bootstrapping
This page was built for publication: Bootstrapping for HElib
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948347)
