Collision-Free Hashing from Lattice Problems

Author(s)
Goldreich, Oded; Goldwasser, Shafrira; Halevi, Shai
Thumbnail
DownloadAccepted version (143.5Kb)
Alternative title
Collision-Free Hashing from Lattice Problems
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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
Date issued
2011
URI
https://hdl.handle.net/1721.1/121244
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-3-642-22669-4
978-3-642-22670-0
Collections