Daniele Micciancio  Home/Search
Context Related
| ucsd.edu/~daniele/papers/CVPP.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/~daniele/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give a new simple proof of the NP-hardness of the closest vector problem. In addition to being much simpler than all previously known proofs, the new proof yields new interesting results about the complexity of the closest vector problem with preprocessing. This is a variant of the closest vector problem in which the lattice is speci ed in advance, and can be preprocessed for an arbitrarily long amount of time before the target vector is revealed. We show that there are lattices for which... (Update)
Similar documents based on text: More All
1.1: Approximating Shortest Lattice Vectors is Not.. - Goldreich.. (1999) (Correct)
0.9: Improved Inapproximability of Lattice and Coding Problems with.. - Regev (2003) (Correct)
0.9: The Shortest Vector in a Lattice is Hard to Approximate to.. - Micciancio (1998) (Correct)
BibTeX entry: (Update)
D. Micciancio. The hardness of the closest vector problem with preprocessing. IEEE Transactions on Information Theory, 2001. To Appear. http://citeseer.ist.psu.edu/micciancio01hardness.html More
@article{ micciancio01hardness,
author = "Micciancio",
title = "The Hardness of the Closest Vector Problem with Preprocessing",
journal = "IEEETIT: IEEE Transactions on Information Theory",
volume = "47",
year = "2001",
url = "citeseer.ist.psu.edu/micciancio01hardness.html" }
Citations (may not include all citations):313 The Viterbi algorithm (context) - Forney - 1973
258 Lattices and Groups (context) - Conway, Sloane et al. - 1998
120 The hardness of approximate optima in lattices (context) - Arora, aszl et al. - 1997
116 Some connections between nonuniform and uniform complexity c.. (context) - Karp, Lipton
103 Factoring polynomials with rational coecients (context) - Lenstra, Lenstra et al. - 1982
96 a guide to the theory of NP-completeness (context) - Garey, Johnson et al. - 1979
66 On Lovasz' lattice reduction and the nearest lattice point p.. (context) - aszl, Babai - 1986
60 Solving low-density subset sum problems (context) - rey, Lagarias et al. - 1985
51 A hierarchy of polynomial time lattice basis reduction algor.. (context) - Schnorr - 1987
49 Minkowski's convex body theorem and integer programming (context) - Kannan - 1987
49 Improved low-density subset sum algorithms - Coster, Joux et al. - 1992
42 A public-key cryptosystem with worstcase /average-case equiv.. - os, Cynthia - 1997
42 Public-key cryptosystems from lattice reduction problems - Goldreich, Goldwasser et al. - 1997
31 Approximating CVP to within almost-polynomial factors is NP-.. - Dinur, Kindler et al. - 1998
17 New bounds in some transference theorems in the geometry of .. (context) - Banaszczyk - 1993
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-cse.ucsd.edu/~daniele/papers.html): More
Oblivious Data Structures: Applications to Cryptography - Micciancio (1997) (Correct)
Approximating Shortest Lattice Vectors is Not.. - Goldreich.. (Correct)
Perfectly One-Way Probabilistic Hash Functions - Canetti, Micciancio, Reingold (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC