Limits on the Provable Consequences of One-way Permutations

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

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Russell Impagliazzo , Steven Rudich

Citations:

138 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Limits on the Provable Consequences of One-way Permutations	user correction - Legacy Corrections
AUTHOR NAME	Russell Impagliazzo	user correction - Legacy Corrections
AUTHOR AFFIL	Computer Science Division; University of California at Berkeley	user correction - Legacy Corrections
AUTHOR ADDR	Berkeley, California 94720	user correction - Legacy Corrections
AUTHOR NAME	Steven Rudich	user correction - Legacy Corrections
AUTHOR AFFIL	Computer Science Department; University of Toronto	user correction - Legacy Corrections
AUTHOR ADDR	Toronto, Canada M5S 1A4	user correction - Legacy Corrections
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	user correction - Legacy Corrections
YEAR	1989	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	44--61	INFERENCE
CITATIONS	22 found	ParsCit 1.0