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

arXiv:2303.01476 · Lecture notes in computer science

Oblivious Transfer from Zero-Knowledge Proofs: Or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States

Léo Colisson, Garazi Muguruza, Florian Speelman

Published Jan 1, 2023• 6 citations
arXivHTMLPDF
DOI
10.1007/978-981-99-8742-9_1

Related papers

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

Yehuda Lindell, Hila Zarosim

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

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

Yehuda Lindell, Hila Zarosim

Journal of Cryptology•Jul 27, 2010•19 citations

Concurrent oblivious transfer

Juan A. Garay, PHILIP D. MACKENZIE

We consider the problem of designing an efficient oblivious transfer (OT) protocol that is provably secure in a concurrent setting, i.e., where many OT sessions may be running concurrently with their messages interleaved arbitrarily. Known OT protocols use zero-knowledge proofs, and no concurrent zero-knowledge proofs are known that use less than a poly-logarithmic number of rounds (at least without requiring a pre-processing phase, a public random string, an auxiliary string, timing constraints, or pre-distributed public keys). We introduce a model for proving security of concurrent OT protocols, and present a protocol that is proven secure in this model based on the decisional Diffie-Hellman problem. The protocol is efficient, requiring only a slightly non-constant number of rounds.

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

General Properties of Quantum Zero-Knowledge Proofs

Hirotada Kobayashi

arXiv:0705.1129•Springer eBooks•Feb 25, 2008•44 citations

Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)

Jun Yan, Jian Weng, Dongdai Lin +1 more

Lecture notes in computer science•Jan 1, 2015•21 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
We consider the problem of designing an efficient oblivious transfer (OT) protocol that is provably secure in a concurrent setting, i.e., where many OT sessions may be running concurrently with their messages interleaved arbitrarily. Known OT protocols use zero-knowledge proofs, and no concurrent zero-knowledge proofs are known that use less than a poly-logarithmic number of rounds (at least without requiring a pre-processing phase, a public random string, an auxiliary string, timing constraints, or pre-distributed public keys). We introduce a model for proving security of concurrent OT protocols, and present a protocol that is proven secure in this model based on the decisional Diffie-Hellman problem. The protocol is efficient, requiring only a slightly non-constant number of rounds.
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.