A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Limits on the provable consequences of one-way permutations
1989
Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89
We present strong evidence that the implication, "if one-way permutations exist, then secure secret key agreement is possible", is not provable by standard techniques. Since both sides of this implication are widely believed true in real life, to show that the implication is false requires a new model. We consider a world where all parties have access to a black box for a randomly selected permutation. Being totally random, this permutation will be strongly oneway in a provable,
doi:10.1145/73007.73012
dblp:conf/stoc/ImpagliazzoR89
fatcat:luinwsh245d57bjzjgvgpbxez4