Paper 1996/009
Collision-Free Hashing from Lattice Problems
Oded Goldreich, Shafi Goldwasser, and Shai Halevi
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.
Metadata
- Available format(s)
- PS
- Publication info
- Published elsewhere. Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
- Keywords
- ComplexityCollision-Free HashingLattice Reduction.
- Contact author(s)
- oded @ theory lcs mit edu
- History
- 1996-07-26: received
- Short URL
- https://ia.cr/1996/009
- License
-
CC BY
BibTeX
@misc{cryptoeprint:1996/009,
author = {Oded Goldreich and Shafi Goldwasser and Shai Halevi},
title = {Collision-Free Hashing from Lattice Problems},
howpublished = {Cryptology {ePrint} Archive, Paper 1996/009},
year = {1996},
url = {https://eprint.iacr.org/1996/009}
}