This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
The relationship between public key encryption and oblivious transfer
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
Y. Gertner, Pennsylvania Univ., Philadelphia, PA, USA
S. Kannan, Pennsylvania Univ., Philadelphia, PA, USA
T. Malkin, Pennsylvania Univ., Philadelphia, PA, USA
O. Reingold, Pennsylvania Univ., Philadelphia, PA, USA
M. Viswanathan, Pennsylvania Univ., Philadelphia, PA, USA
In this paper we study the relationships among some of the most fundamental primitives and protocols in cryptography: public-key encryption (i.e. trapdoor predicates), oblivious transfer (which is equivalent to general secure multi-party computation), key agreement and trapdoor permutations. Our main results show that public-key encryption and oblivious transfer are incomparable under black-box reductions. These separations are tightly matched by our positive results where a restricted (strong) version of one primitive does imply the other primitive. We also show separations between oblivious transfer and key agreement. Finally, we conclude that neither oblivious transfer nor trapdoor predicates imply trapdoor permutations. Our techniques for showing negative results follow the oracle separations of R. Impagliazzo and S. Rudich (1989).
Index Terms:
protocols; public key cryptography; public key encryption; oblivious transfer; primitives; protocols; cryptography; trapdoor predicates; secure multi-party computation; key agreement; trapdoor permutations; public-key encryption; black-box reductions
Citation:
Y. Gertner, S. Kannan, T. Malkin, O. Reingold, M. Viswanathan, "The relationship between public key encryption and oblivious transfer," focs, pp.325, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.