## CryptoDB

### Paper: Collision-Free Hashing from Lattice Problems

Authors: Oded Goldreich Shafi Goldwasser Shai Halevi URL: http://eprint.iacr.org/1996/009 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-1996-11275,
title={Collision-Free Hashing from Lattice Problems},
booktitle={IACR Eprint archive},
keywords={Complexity, Collision-Free Hashing, Lattice Reduction.},
url={http://eprint.iacr.org/1996/009},
note={Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive. oded@theory.lcs.mit.edu 10500 received July 26th, 1996.},
author={Oded Goldreich and Shafi Goldwasser and Shai Halevi},
year=1996
}