Collision-Free Hashing from Lattice Problems
Name
cfh.pdf
Description
Accepted version
Size
143.51 KB
Format
Adobe PDF
Checksum (MD5)
a35f6b568e49f12f443788ff1b237b26
Author(s)
Goldreich, Oded
Goldwasser, Shafrira
Halevi, Shai
Alternative Title
Collision-Free Hashing from Lattice Problems
Date Issued
2011
Journal
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation
Publisher
Springer Nature
Citation
Goldreich, Oded, et al. “Collision-Free Hashing from Lattice Problems.” Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, edited by Oded Goldreich, vol. 6650, Springer Berlin Heidelberg, 2011, pp. 30–39.
Version
Author's final manuscript
Abstract
In 1995, 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. This paper contains a self-contained proof sketch of Ajtai's result. Keywords: Integer Lattices, One-EWay Functions, Worst-Case to Average-Case Reductions, Collision-Resistent Hashing
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-22670-0_5
