Paper 1996/009 Original: eprint.iacr.org/1996/009 ↗
Collision-Free Hashing from Lattice Problems
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)
PDF- Publication info
- Preprint.
- History
- 1996-07-26: last updated
- 1996-07-26: published
- Short URL
- https://ia.cr/1996/009
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}