Daniele Micciancio Laboratory for Computer Science Massachusetts Institute of ...  Home/Search
Context Related
| iacr.org/1999/005.ps.gz 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: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a general technique to simplify as well as to improve several lattice based cryptographic protocols. The technique is rather straightforward and is easily applied to the protocols, and gives both a simpler analysis and better performance than the original protocols. (Update)
Similar documents based on text: More All
0.5: Lattice Based Cryptography: A Global Improvement - Micciancio (1999) (Correct)
0.2: Multicast Security: A Taxonomy and Some Efficient.. - Canetti, Garay.. (1999) (Correct)
0.2: Perfectly One-Way Probabilistic Hash Functions - Canetti, Micciancio, Reingold (1998) (Correct)
BibTeX entry: (Update)
D. Micciancio. Lattice based cryptography: A global improvement. Technical report, Theory of Cryptography Library, 1999. Report 99-05. http://citeseer.ist.psu.edu/micciancio99lattice.html More
@misc{ micciancio99lattice,
author = "D. Micciancio",
title = "Lattice based cryptography: A global improvement",
text = "D. Micciancio. Lattice based cryptography: A global improvement. Technical
report, Theory of Cryptography Library, 1999. Report 99-05.",
year = "1999",
url = "citeseer.ist.psu.edu/micciancio99lattice.html" }
Citations (may not include all citations):227 Factoring polynomials with rational coefficients (context) - Lenstra, Lenstra et al. - 1982
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1997
84 Generating hard instances of lattice problems (context) - Ajtai - 1996
66 On Lovasz' lattice reduction and the nearest lattice point p.. (context) - Babai - 1986
51 A hierarchy of polynomial time lattice basis reduction algor.. (context) - Schnorr - 1987
50 Polynomial algorithms for computing the Smith and Hermite no.. (context) - Kannan, Bachem - 1979
42 public key cryptosystem with worst caseaverage case equivale.. - Ajtai, public et al. - 1997
42 Public-key cryptosystems from lattice reduction problems - Goldreich, Goldwasser et al. - 1997
32 the limits of non-approximability of lattice problems - Goldreich, Goldwasser - 1998
31 Approximating CVP to within almost-polynomial factors is NP-.. - Dinur, Kindler et al. - 1998
13 Approximating shortest lattice vectors is not harder than ap.. - Goldreich, Micciancio et al. - 1999
9 The shortest vector problem is NP-hard to approximate to wit.. (context) - Micciancio - 1998
http://theory.lcs.mit.edu/~cis/lattice/challenge.html
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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