Collision-free hashing from lattice problems

Authors:
Oded Goldreich;Shafi Goldwasser;Shai Halevi
Affiliations:
Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Israel;Computer Science Department, Weizmann Institute of Science, Israel and Electrical Engineering and Computer Science Department, MIT;IBM T.J. Watson Research Center
Venue:
Studies in complexity and cryptography
Year:
2011

Citing 4
Cited 0

A more efficient algorithm for lattice basis reduction

Journal of Algorithms
On the existence of pseudorandom generators

SIAM Journal on Computing
Generating hard instances of lattice problems (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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.