(Enter summary)
Abstract: Recently Ajtai described a construction of one-way functions whose security is equivalent to
the difficulty of some well known approximation problems in lattices. We show that essentially
the same construction can also be used to obtain collision-free hashing. (Update)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
O. Goldreich, S. Goldwasser, and S. Halevi. "Collision-Free Hashing from Lattice Problems ". ECCC, TR96-042, 1996. http://www.eccc.uni-trier.de/eccc/ http://citeseer.ist.psu.edu/739779.html More
@article{ goldwasser96collisionfree,
author = "Oded Goldreich and Shafi
Goldwasser and Shai Halevi",
title = "Collision-Free Hashing from Lattice Problems",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "3",
number = "042",
year = "1996",
url = "citeseer.ist.psu.edu/739779.html" }
Citations (may not include all citations):
358
Universal Classes of Hash Functions (context) - Carter, Wegman - 1979
227
Factoring polynomials with rational coefficients (context) - Lenstra, Lenstra et al. - 1982
85
Construction of Pseudorandom Generator from any One-Way Func..
- Hastad, Impagliazzo et al. - 1989
84
Generating Hard Instances of Lattice Problems (context) - Ajtai - 1996
35
the existence of pseudorandom generators (context) - Goldreich, Krawczyk et al. - 1993
18
A more efficient algorithm for a lattice basis reduction (context) - Schnorr - 1988
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