A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
[chapter]
1998
Lecture Notes in Computer Science
We prove the existence of an oracle relative to which there exist seveial well-known cryptographic primitives, including one-way permutations, but excluding (for a suitably strong definition) collision-intractible hash functions. Thus any proof that such functions can be derived from these weaker primitives is necessarily non-relativizing; in particular, no provable construction of a collision-intractable hash function can exist based solely on a "black box" one-way permutation. This result can
doi:10.1007/bfb0054137
fatcat:oq6qfgldnfesfgdz4wjoxvarmi