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
From MaRDI portal
Publication:2152045
DOI10.1007/978-3-030-65277-7_20zbMath1492.94099OpenAlexW3110720256MaRDI QIDQ2152045
Natalia Kharchenko, Thomas Espitau, Antoine Joux
Publication date: 6 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_20
Related Items (6)
Predicting the concrete security of LWE against the dual attack using binary search ⋮ Discretization error reduction for high precision torus fully homomorphic encryption ⋮ Hybrid dual and meet-LWE attack ⋮ Does the dual-sieve attack on learning with errors even work? ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
Cites Work
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- On the concrete hardness of learning with errors
- Factoring polynomials with rational coefficients
- TFHE: fast fully homomorphic encryption over the torus
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
- Practical, Predictable Lattice Basis Reduction
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Fully Homomophic Encryption over the Integers Revisited
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Enumeration Using Extreme Pruning
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- New directions in nearest neighbor searching with applications to lattice sieving
- Solving BDD by Enumeration: An Update
- Lattice Decoding Attacks on Binary LWE
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- 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: 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
