Work

Collision-Free Hashing from Lattice Problems

Year: 1996

Type: preprint

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.

Source: IACR Cryptology ePrint Archive

Authors: Oded Goldreich, Shafi Goldwasser, Shai Halevi

Institutions: Weizmann Institute of Science, IBM Research - Thomas J. Watson Research Center

Language: English

Topic: Cryptography and Data Security

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2180929963

Cites: 4

Cited by: 92

Related to: 10