scientific article; zbMATH DE number 1775382
From MaRDI portal
Publication:4542514
Recommendations
- On the limits of nonapproximability of lattice problems
- The shortest vector in a lattice is hard to approximate to within some constant
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- On the complexity of lattice problems with polynomial approximation factors
- Lattice problems in NP ∩ coNP
Cited in
(23)- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- On the limits of nonapproximability of lattice problems
- Interactive and probabilistic proof-checking
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- Two-message statistically sender-private OT from LWE
- New (and old) proof systems for lattice problems
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- Extension of Hoshen-Kopelman algorithm to non-lattice environments
- Zero-knowledge interactive proof systems for new lattice problems
- Lattice problems in NP ∩ coNP
- More on average case vs approximation complexity
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- On the power of statistical zero knowledge
- Hermite’s Constant and Lattice Algorithms
- Inapproximability Results for Computational Problems on Lattices
- On the complexity of lattice problems with polynomial approximation factors
- A Digital Signature Scheme Based on CVP ∞
- The Complexity of Zero Knowledge
- Lattice-based inner product argument
- Public-key encryption from homogeneous CLWE
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542514)
