Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IFIP International Federation for Information Processing/IFIP

Conference Key Agreement Protocol using Oblivious Transfer

Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi

Published Jan 1, 2002• 0 citations
Publisher
DOI
10.1007/0-306-47008-x_31

Related papers

Conference key agreement protocol using oblivious transfer

Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi

•Jan 1, 2001•0 citations

Construction of m-out-of-n Oblivious Transfer

Zhide Chen

Oblivious transfer(OT)is used as a key component in many applications of cryptography. In this paper, a1-out-of-n oblivious transfer is constructed based on the sub protocol 1-out-of-2 oblivious transfer;an m-out-of-n oblivious transfer is constructed based on the sub protocol 1-out-of-n oblivious transfer. Finally,a1-out-of-2 oblivious transfer is constructed based on public key system. By this way,any existed public key system can be used to construct m-out-of-n oblivious transfer.

Journal of Chinese Computer Systems•Jan 1, 2006•0 citations

Round-Efficient Conference Key Agreement Protocols with Provable Security

Wen-Guey Tzeng, Zhi-Jia Tzeng

Lecture notes in computer science•Jan 1, 2000•61 citations

The relationship between public key encryption and oblivious transfer

Yael Gertner, S. Kannan, Tal Malkin +2 more

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).

Annual Symposium on Foundations of Computer Science•Nov 7, 2002•208 citations

A Practical and Secure Fault-Tolerant Conference-Key Agreement Protocol

Wen-Guey Tzeng

Lecture notes in computer science•Jan 1, 2000•37 citations

Oblivious Transfer Based on Key Exchange

Abhishek Parakh

Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this article, we present protocols for mutual exchange of secrets, 1-out-of-2 OT and coin-flipping similar to the Diffie-Hellman protocol using the idea of obliviously exchanging encryption keys. Since the Diffie-Hellman scheme is widely used, our protocol may provide a useful alternative to the conventional methods for implementation of oblivious transfer and a useful primitive in building larger cryptographic schemes.

arXiv:0705.0178•Cryptologia•Jan 10, 2008•13 citations
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).
Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this article, we present protocols for mutual exchange of secrets, 1-out-of-2 OT and coin-flipping similar to the Diffie-Hellman protocol using the idea of obliviously exchanging encryption keys. Since the Diffie-Hellman scheme is widely used, our protocol may provide a useful alternative to the conventional methods for implementation of oblivious transfer and a useful primitive in building larger cryptographic schemes.