Homomorphic lower digits removal and improved FHE bootstrapping
From MaRDI portal
Publication:1648799
DOI10.1007/978-3-319-78381-9_12zbMath1420.94049OpenAlexW2794634409MaRDI QIDQ1648799
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_12
Related Items
Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Field instruction multiple data ⋮ Bootstrapping for helib ⋮ On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption ⋮ BLEACH: cleaning errors in discrete computations over CKKS ⋮ Hybrid dual and meet-LWE attack ⋮ Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Bootstrapping for BGV and BFV revisited ⋮ Unnamed Item ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- Faster bootstrapping of FHE over the integers
- Fixed-point arithmetic in SHE schemes
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- NFLlib: NTT-Based Fast Lattice Library
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Better Bootstrapping in Fully Homomorphic Encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW with Efficient Multibit Bootstrapping
- Fully Homomophic Encryption over the Integers Revisited
- (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- How to Obfuscate Programs Directly
- Cliptography: Clipping the Power of Kleptographic Attacks
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- On the CCA1-Security of Elgamal and Damgård’s Elgamal
- The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
- Fully Homomorphic Encryption over the Integers
- On obfuscating point functions
- On Polynomial Systems Arising from a Weil Descent
- ML Confidential: Machine Learning on Encrypted Data
- Privacy-Friendly Forecasting for the Smart Grid Using Homomorphic Encryption and the Group Method of Data Handling
- Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
