The Community for Technology Leaders
RSS Icon
Subscribe
Redondo Beach, California
Nov. 12, 2000 to Nov. 14, 2000
ISBN: 0-7695-0850-2
pp: 325
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
ABSTRACT
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, 2000, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2000, pp. 325, doi:10.1109/SFCS.2000.892121
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool