Pages that link to "Item:Q3183586"
From MaRDI portal
The following pages link to On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem (Q3183586):
Displayed 23 items.
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- A note on BDD problems with \(\lambda_2\)-gap (Q2350585) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Improved analysis of the reduction from BDD to uSVP (Q2419802) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- On the Efficacy of Solving LWE by Reduction to Unique-SVP (Q3193270) (← links)
- The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
- An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem (Q3297526) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE (Q6108625) (← links)