On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
From MaRDI portal
Publication:3183586
DOI10.1007/978-3-642-03356-8_34zbMath1252.94084OpenAlexW1490468194MaRDI QIDQ3183586
Daniele Micciancio, Vadim Lyubashevsky
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_34
Related Items (23)
Improved hardness results for unique shortest vector problem ⋮ On the Efficacy of Solving LWE by Reduction to Unique-SVP ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors ⋮ Estimation of the hardness of the learning with errors problem with a restricted number of samples ⋮ Improved analysis of the reduction from BDD to uSVP ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE ⋮ On the asymptotic complexity of solving LWE ⋮ Improved broadcast attacks against subset sum problems via lattice oracle ⋮ The hunting of the SNARK ⋮ The Reductions for the Approximating Covering Radius Problem ⋮ An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps ⋮ Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle ⋮ The Geometry of Lattice Cryptography ⋮ On the success probability of solving unique SVP via BKZ ⋮ Hardness of bounded distance decoding on lattices in lp norms ⋮ Public-Key Cryptographic Primitives Provably as Secure as Subset Sum ⋮ A note on BDD problems with \(\lambda_2\)-gap
Uses Software
This page was built for publication: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
