On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
From MaRDI portal
Publication:5738971
DOI10.1007/978-3-319-56614-6_4zbMath1415.94402OpenAlexW2593939958MaRDI QIDQ5738971
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_4
Related Items (20)
Homomorphic Encryption Standard ⋮ 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 ⋮ Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ Sine series approximation of the mod function for bootstrapping of approximate HE ⋮ Improved filter permutators for efficient FHE: better instances and implementations ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ Hybrid dual and meet-LWE attack ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Does the dual-sieve attack on learning with errors even work? ⋮ Finding and evaluating parameters for BGV ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Unnamed Item ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ On the success probability of solving unique SVP via BKZ ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Unnamed Item ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings
- Advances in cryptology -- EUROCRYPT 2015. 34th annual international conference on the theory and applications of cryptographic techniques, Sofia, Bulgaria, April 26--30, 2015. Proceedings. Part I
- On the concrete hardness of learning with errors
- On the complexity of the BKW algorithm on LWE
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II
- Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
- (Leveled) fully homomorphic encryption without bootstrapping
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Algorithms in HElib
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Lattice Point Enumeration on Block Reduced Bases
- Better Algorithms for LWE and LWR
- Fully Homomophic Encryption over the Integers Revisited
- A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Coded-BKW: Solving LWE Using Lattice Codes
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- On Ideal Lattices and Learning with Errors over Rings
- Some Recent Progress in Lattice-Based Cryptography
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Lattice-based Cryptography
- New directions in nearest neighbor searching with applications to lattice sieving
- Solving BDD by Enumeration: An Update
- A Toolkit for Ring-LWE Cryptography
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Lattice Decoding Attacks on Binary LWE
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Lazy Modulus Switching for the BKW Algorithm on LWE
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
