## Limits on the Provable Consequences of One-way Permutations (1989)

### Cached

### Download Links

- [dsns.csie.nctu.edu.tw]
- [www.cs.cmu.edu]
- [www.cse.ucsd.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 162 - 0 self |

### BibTeX

@INPROCEEDINGS{Impagliazzo89limitson,

author = {Russell Impagliazzo and Steven Rudich},

title = {Limits on the Provable Consequences of One-way Permutations},

booktitle = {},

year = {1989},

pages = {44--61}

}

### Years of Citing Articles

### OpenURL

### Abstract

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 dl parties have access to a black box or a randomly selected permutation. Being totally random, this permutation will be strongly oneway in provable, information-thevretic way. We show that, if P = NP, no protocol for secret key agreement is secure in such setting. Thus, to prove that a secret key greement protocol which uses a one-way permutation as a black box is secure is as hrd as proving F NP. We also obtain, as corollary, that there is an oracle relative to which the implication is false, i.e., there is a one-way permutation, yet secret-exchange is impossible. Thus, no technique which relativizes can prove that secret exchange can be based on any one-way permutation. Our results present a general framework for proving statements of the form, "Cryptographic application X is not likely possible based solely on complexity assumption Y." 1