Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-22670-0_5 | Electronic Colloquium on Computational Complexity |
Keywords | DocType | Volume |
one-way function,approximation problem,self-contained proof sketch,lattice problem | Journal | 1996 |
Citations | PageRank | References |
54 | 5.93 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oded Goldreich | 1 | 12376 | 2035.01 |
| Shafi Goldwasser | 2 | 9935 | 2069.05 |
| Shai Halevi | 3 | 7203 | 442.70 |