Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
From MaRDI portal
Publication:2958113
DOI10.1007/978-3-662-53887-6_1zbMath1384.94044OpenAlexW2554750353MaRDI QIDQ2958113
Ilaria Chillotti, Malika Izabachène, Mariya Georgieva, Nicolas Gama
Publication date: 1 February 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53887-6_1
Related Items
Homomorphic Encryption Standard ⋮ Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption ⋮ 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 ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Encrypted SQL arithmetic functions processing for secure cloud database ⋮ Field instruction multiple data ⋮ Bootstrapping for helib ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ 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 ⋮ BLEACH: cleaning errors in discrete computations over CKKS ⋮ Optimisations and tradeoffs for HElib ⋮ Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Batched fully homomorphic encryption from TFHE ⋮ Homomorphic encryption: a mathematical survey ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Revisiting homomorphic encryption schemes for finite fields ⋮ Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain ⋮ Coefficient grouping for complex affine layers ⋮ Fast blind rotation for bootstrapping FHEs ⋮ HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering ⋮ Efficient homomorphic comparison methods with optimal complexity ⋮ Unsupervised Machine Learning on encrypted data ⋮ Boolean Functions for Homomorphic-Friendly Stream Ciphers ⋮ Practical Fully Homomorphic Encryption for Fully Masked Neural Networks ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes ⋮ On the deductive security of queries to databases with multi-bit records ⋮ Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory ⋮ SPEED: secure, private, and efficient deep learning ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Boosting verifiable computation on encrypted data ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ Unnamed Item ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Uses Software
Cites Work
- On the concrete hardness of learning with errors
- On the complexity of the BKW algorithm on LWE
- A Homomorphic LWE Based E-voting Scheme
- Practical, Predictable Lattice Basis Reduction
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Fully Homomophic Encryption over the Integers Revisited
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- On Ideal Lattices and Learning with Errors over Rings
- Solving BDD by Enumeration: An Update
- Fully homomorphic encryption using ideal lattices
- Predicting Lattice Reduction
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
