[GGH96] Collision-Free Hashing from Lattice Problems

Authors: Oded Goldreich, Shafi Goldwasser, Shai Halevi | Venue: Cryptology ePrint Archive 1996 | Source

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.

BibTeX

Copy

@Misc{EPRINT:GolGolHal96a,
  author = {Oded Goldreich and Shafi Goldwasser and Shai Halevi},
  title = {Collision-Free Hashing from Lattice Problems},
  year = {1996},
  url = {https://eprint.iacr.org/1996/009},
  howpublished = {Cryptology ePrint Archive, Report 1996/009},
}