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

t-Out-of-n String/Bit Oblivious Transfers Revisited

Qianhong Wu, Bo Qin, Changjie Wang, Xiaofeng Chen, Yumin Wang

Published Jan 1, 2005• 3 citations
Publisher
DOI
10.1007/978-3-540-31979-5_35

Related papers

Efficient Committed Oblivious Transfer of Bit Strings

Mehmet Sabır Kiraz, Berry Schoenmakers, José Villegas

Lecture notes in computer science•Jan 1, 2007•15 citations

“The simplest protocol for oblivious transfer” revisited

Ziya Alper Genç, Vincenzo Iovino, Alfredo Rial

Information Processing Letters•Jun 4, 2020•11 citations

Efficient Additive Randomized Encodings for String Oblivious Transfer: A Core Primitive for General Functions

Masaya Yoshimura, Kyoichi Asano, Yugo Kasashima +2 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Practical t-out-n Oblivious Transfer and Its Applications

Qianhong Wu, Jianhong Zhang, Yumin Wang

Lecture notes in computer science•Jan 1, 2003•22 citations

Reducing oblivious string transfer to universal oblivious transfer

Stefan Wolf

It is shown that oblivious transfer of strings can be reduced to the weakest version of oblivious bit transfer, where the receiver can choose to obtain arbitrary (but incomplete) information about the pair of bits sent. This solves an open problem posed by Brassard and Crepeau (see Advances in Cryptography$EUROCRYPT' 97, LNCS, vol.1233, p.334-45, Springer-Verlag, 1997).

IEEE International Symposium on Information Theory (ISIT)•Nov 7, 2002•7 citations

An efficient COT protocol

Bo Yang

Committed oblivious transfer is the natural fusion of one-out-of-two oblivious transfer and bit commitment. Unfortunately, the protocols proposed before are not only complicated but also very inefficient. This paper describes a new committed oblivious transfer protocol based on a first two round string oblivious transfer and bit commitment with XOR. With a first two round string oblivious transfer, the protocol can avoid performing a large number of bit oblivious transfers. And with bit commitment with XOR, zero knowledge proofs are very easy. The protocol is conceptually simple and more efficient. The security and complexity of the protocol are also discussed in this paper.

Journal of Circuits and Systems•Jan 1, 2006•0 citations
Committed oblivious transfer is the natural fusion of one-out-of-two oblivious transfer and bit commitment. Unfortunately, the protocols proposed before are not only complicated but also very inefficient. This paper describes a new committed oblivious transfer protocol based on a first two round string oblivious transfer and bit commitment with XOR. With a first two round string oblivious transfer, the protocol can avoid performing a large number of bit oblivious transfers. And with bit commitment with XOR, zero knowledge proofs are very easy. The protocol is conceptually simple and more efficient. The security and complexity of the protocol are also discussed in this paper.