FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
From MaRDI portal
Publication:2948346
DOI10.1007/978-3-662-46800-5_24zbMath1370.94509OpenAlexW913176383MaRDI QIDQ2948346
Publication date: 30 September 2015
Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/23686
Related Items (68)
On the hardness of module-LWE with binary secret ⋮ Homomorphic Encryption Standard ⋮ New Ideas to Build Noise-Free Homomorphic Cryptosystems ⋮ An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers ⋮ Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography ⋮ Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm ⋮ Transciphering, using FiLIP and TFHE for an efficient delegation of computation ⋮ 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 ⋮ FASTA -- a stream cipher for fast FHE evaluation ⋮ Practical private-key fully homomorphic encryption in rings ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Field instruction multiple data ⋮ Bootstrapping for helib ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ FHEW with Efficient Multibit Bootstrapping ⋮ On the hardness of module learning with errors with short distributions ⋮ Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization ⋮ Discretization error reduction for high precision torus fully homomorphic encryption ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Oblivious message retrieval ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Parameter optimization and larger precision for (T)FHE ⋮ Batched fully homomorphic encryption from TFHE ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Homomorphic encryption: a mathematical survey ⋮ Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Balanced non-adjacent forms ⋮ Revisiting homomorphic encryption schemes for finite fields ⋮ Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain ⋮ Fast blind rotation for bootstrapping FHEs ⋮ HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering ⋮ Accelerating HE operations from key decomposition technique ⋮ Private AI: Machine Learning on Encrypted Data ⋮ Efficient homomorphic comparison methods with optimal complexity ⋮ Towards classical hardness of module-LWE: the linear rank case ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ A full RNS variant of approximate homomorphic encryption ⋮ Unsupervised Machine Learning on encrypted data ⋮ Boolean Functions for Homomorphic-Friendly Stream Ciphers ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes ⋮ Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption ⋮ Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications ⋮ Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Boosting verifiable computation on encrypted data ⋮ Accelerating Homomorphic Computations on Rational Numbers ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ FHE Circuit Privacy Almost for Free ⋮ Homomorphic Encryption ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Uses Software
This page was built for publication: FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
