The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Abstract
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost linear in the dimension of the lattice. The lattice problems we consider are the shortest vector problem, the shortest independent vectors problem, the covering radius problem, and the guaranteed distance decoding problem (a variant of the well‐known closest vector problem). The approximation factor we obtain is $n \log^{O(1)} n$ for all four problems. This greatly improves on all previous work on the subject starting from Ajtai’s seminal paper [Generating hard instances of lattice problems, in Complexity of Computations and Proofs, Quad. Mat. 13, Dept. Math., Seconda Univ. Napoli, Caserta, Italy, 2004, pp. 1–32] up to the strongest previously known results by Micciancio [SIAM J. Comput., 34 (2004), pp. 118–169]. Our results also bring us closer to the limit where the problems are no longer known to be in NP intersect coNP. Our main tools are Gaussian measures on lattices and the high‐dimensional Fourier transform. We start by defining a new lattice parameter which determines the amount of Gaussian noise that one has to add to a lattice in order to get close to a uniform distribution. In addition to yielding quantitatively much stronger results, the use of this parameter allows us to simplify many of the complications in previous work. Our technical contributions are twofold. First, we show tight connections between this new parameter and existing lattice parameters. One such important connection is between this parameter and the length of the shortest set of linearly independent vectors. Second, we prove that the distribution that one obtains after adding Gaussian noise to the lattice has the following interesting property: the distribution of the noise vector when conditioning on the final value behaves in many respects like the original Gaussian noise vector. In particular, its moments remain essentially unchanged.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.2307/2282952 · Cited by 1,166
On Lovász’ lattice reduction and the nearest lattice point problem
Babai, L. (1986) · Combinatorica · doi:10.1007/bf02579403 · Cited by 938
New bounds in some transference theorems in the geometry of numbers
Banaszczyk, W. (1993) · Mathematische Annalen · doi:10.1007/bf01445125 · Cited by 461
New lattice-based cryptographic constructions
Regev, O. (2004) · Journal of the ACM · doi:10.1145/1039488.1039490 · Cited by 292
Self-citationOn the Limits of Nonapproximability of Lattice Problems
Goldreich, O., & Goldwasser, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1686 · Cited by 231
Hardness of approximating the shortest vector problem in lattices
Khot, S. (2005) · Journal of the ACM · doi:10.1145/1089023.1089027 · Cited by 212
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
Micciancio, D. (2001) · SIAM Journal on Computing · doi:10.1137/s0097539700373039 · Cited by 212
Self-citationAharonov, D., & Regev, O. (2005) · Journal of the ACM · doi:10.1145/1089023.1089025 · Cited by 179
Self-citationApproximating shortest lattice vectors is not harder than approximating closest lattice vectors
Goldreich, O., Micciancio, D., Safra, M., & Seifert, J. (1999) · Information Processing Letters · doi:10.1016/s0020-0190(99)00083-6 · Cited by 146
Self-citation
Cited by
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
Self-citationOn-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
Self-citationLattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
A Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
Metadata
- Authors
- Micciancio, D., & Regev, O.
- Venue
- SIAM Journal on Computing
- Published
- 2007-01
- Volume
- 37
- Issue
- 1
- Pages
- 267-302
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1994790157
- Cited by
- 907
- References
- 11
- FWCI
- 26.40
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures. https://app.cochat.ai/papers/10.1137/s0097539705447360
- The paper
- Micciancio, D., & Regev, O. (2007). Worst‐Case to Average‐Case Reductions Based on Gaussian Measures. SIAM Journal on Computing. https://doi.org/10.1137/s0097539705447360
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.