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

Efficient Committed Oblivious Transfer of Bit Strings

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

Published Jan 1, 2007• 15 citations
Publisher
DOI
10.1007/978-3-540-75496-1_9

Related papers

Efficient and Universally Composable Committed Oblivious Transfer and Applications

Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang

Springer eBooks•Jan 26, 2007•2 citations

Efficient and Universally Composable Committed Oblivious Transfer and Applications

Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang

Lecture notes in computer science•Jan 1, 2004•60 citations

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

Qianhong Wu, Bo Qin, Changjie Wang +2 more

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

Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer

Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou

Lecture notes in computer science•Jan 1, 2009•55 citations

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

Ran Canetti, Pratik Sarkar, Xiao Shaun Wang

Lecture notes in computer science•Jan 1, 2020•17 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.