Homomorphic lower digits removal and improved FHE bootstrapping
From MaRDI portal
(Redirected from Publication:1648799)
Recommendations
Cites work
- (Batch) fully homomorphic encryption over integers for non-binary message spaces
- (Leveled) fully homomorphic encryption without bootstrapping
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for HElib
- Cliptography: clipping the power of kleptographic attacks
- Efficient fully homomorphic encryption from (standard) LWE
- FHEW with Efficient Multibit Bootstrapping
- FHEW: bootstrapping homomorphic encryption in less than a second
- Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
- Faster bootstrapping of FHE over the integers
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Fixed-point arithmetic in SHE schemes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomophic encryption over the integers revisited
- Fully homomorphic SIMD operations
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to obfuscate programs directly
- Improved security for a ring-based fully homomorphic encryption scheme
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- ML confidential: machine learning on encrypted data
- NFLlib: NTT-Based Fast Lattice Library
- On obfuscating point functions
- On polynomial systems arising from a Weil descent
- On the CCA1-security of Elgamal and Damgård's Elgamal
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- On the concrete hardness of learning with errors
- Privacy-friendly forecasting for the smart grid using homomorphic encryption and the group method of data handling
- Scale-invariant fully homomorphic encryption over the integers
- The brave new world of bodacious assumptions in cryptography
- The dark side of ``black-box cryptography or: should we trust Capstone?
Cited in
(19)- Bootstrapping for BGV and BFV revisited
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Bootstrapping for helib
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- 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
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Flexible and efficient verifiable computation on encrypted data
- Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- Hybrid dual and meet-LWE attack
- Practical FHE parameters against lattice attacks
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Fast blind rotation for bootstrapping FHEs
- BLEACH: cleaning errors in discrete computations over CKKS
- Field instruction multiple data
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
This page was built for publication: Homomorphic lower digits removal and improved FHE bootstrapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648799)
