TFHE: fast fully homomorphic encryption over the torus
From MaRDI portal
Publication:2303454
DOI10.1007/s00145-019-09319-xzbMath1455.94141OpenAlexW2942255051WikidataQ123008951 ScholiaQ123008951MaRDI QIDQ2303454
Nicolas Gama, Ilaria Chillotti, Malika Izabachène, Mariya Georgieva
Publication date: 3 March 2020
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/674374
Related Items (36)
Faster homomorphic encryption over GPGPUs via hierarchical DGT ⋮ 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 ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Discretization error reduction for high precision torus fully homomorphic encryption ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ BLEACH: cleaning errors in discrete computations over CKKS ⋮ Optimisations and tradeoffs for HElib ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Oblivious message retrieval ⋮ Parameter optimization and larger precision for (T)FHE ⋮ Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Batched fully homomorphic encryption from TFHE ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher ⋮ Balanced non-adjacent forms ⋮ Transciphering framework for approximate homomorphic encryption ⋮ Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE ⋮ 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 ⋮ Accelerating HE operations from key decomposition technique ⋮ Private AI: Machine Learning on Encrypted Data ⋮ High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function ⋮ TFHE ⋮ Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- A full RNS variant of approximate homomorphic encryption
- Estimate all the {LWE, NTRU} schemes!
- On the complexity of the BKW algorithm on LWE
- An improved RNS variant of the BFV homomorphic encryption scheme
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- On the Determinization of Weighted Finite Automata
- A Homomorphic LWE Based E-voting Scheme
- Practical, Predictable Lattice Basis Reduction
- (Leveled) fully homomorphic encryption without bootstrapping
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Algorithms in HElib
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Packing Messages and Optimizing Bootstrapping in GSW-FHE
- Fully Homomophic Encryption over the Integers Revisited
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Lattice-based FHE as secure as PKE
- BKZ 2.0: Better Lattice Security Estimates
- Attribute-Based Encryption for Circuits
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Efficient Public Key Encryption Based on Ideal Lattices
- Solving BDD by Enumeration: An Update
- Batch Fully Homomorphic Encryption over the Integers
- Homomorphic Encryption Standard
- Fully homomorphic encryption using ideal lattices
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- Predicting Lattice Reduction
- Classical hardness of learning with errors
- Automata, Languages and Programming
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Short Stickelberger Class Relations and Application to Ideal-SVP
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- 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
This page was built for publication: TFHE: fast fully homomorphic encryption over the torus
