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

Lecture notes in computer science

General Public Key m-Out-of-n Oblivious Transfer

Zhide Chen, Hong Ping Zhu

Published Jan 1, 2004• 0 citations
Publisher
DOI
10.1007/978-3-540-30497-5_137

Related papers

Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem

Claude Crépeau, Raza Ali Kazmi

Lecture notes in computer science•Jan 1, 2015•3 citations

Public-key Encryption

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•1 citation

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

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

m out of n Oblivious Transfer

Yi Mu, Junqi Zhang, Vijay Varadharajan

Lecture notes in computer science•Jan 1, 2002•49 citations

Leakage-Resilient k-out-of-n Oblivious Transfer

Shuguang Dai, Huang Zhang, Yaofeng Ma +1 more

International Conference on Artificial Intelligence and Computing (AIC)•Apr 1, 2026•0 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).