Limits on the provable consequences of one-way permutations

@inproceedings{ImpagLOTPC89_083, 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,...}, author = {Impagliazzo, R. and Rudich, S. }, citeulike-article-id = {1092942}, keywords = {black-box, seperations}, pages = {44--61}, posted-at = {2007-02-09 01:20:41}, priority = {2}, title = {Limits on the provable consequences of one-way permutations}, url = {http://citeseer.ist.psu.edu/impagliazzo89limits.html}, year = {1989} }

TY - CONF ID - ImpagLOTPC89_083 L3 - citeulike-article-id:1092942 TI - Limits on the provable consequences of one-way permutations SP - 44 EP - 61 N2 - 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,... KW - black-box KW - seperations AU - Impagliazzo, R AU - Rudich, S PY - 1989/// UR - http://citeseer.ist.psu.edu/impagliazzo89limits.html ER -