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:quant-ph/0504134 · Quantum Information Processing

The Physics of No-Bit-Commitment: Generalized Quantum Non-Locality Versus Oblivious Transfer

Anthony J. Short, Nicolas Gisin, Sandu Popescu

Published Apr 1, 2006• 29 citations
arXivHTMLPDF
DOI
10.1007/s11128-006-0015-4

Related papers

Quantum Bit Commitment Based on Qubit Oblivious Transfer

Yang Yang, Wei Wei, Huang +5 more

Chinese Journal of Electronics•Jan 1, 2009•0 citations

Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer

Yaqi Song, Li Yang

Oblivious transfer (OT) and bit commitment (BC) are two-party cryptographic protocols which play crucial roles in the construction of various cryptographic protocols. We propose three practical quantum cryptographic protocols in this paper. We first construct a practical quantum random oblivious transfer (R-OT) protocol based on the fact that non-orthogonal states cannot be reliably distinguished. Then, we construct a fault-tolerant one-out-of-two oblivious transfer ( O T 1 2 ) protocol based on the quantum R-OT protocol. Afterwards, we propose a quantum bit commitment (QBC) protocol which executes the fault-tolerant O T 1 2 several times. Mayers, Lo and Chau (MLC) no-go theorem proves that QBC protocol cannot be unconditionally secure. However, we find that computing the unitary transformation of no-go theorem attack needs so many resources that it is not realistically implementable. We give a definition of physical security for QBC protocols and prove that the practical QBC we proposed is physically secure and can be implemented in the real world.

Applied Sciences•Oct 19, 2018•8 citations

The Quantum Bit Commitment Theorem

Jeffrey Bub

arXiv:quant-ph/0007090•Foundations of Physics•May 1, 2001•33 citations

Quantum oblivious transfer and bit commitment protocols based on two non-orthogonal states coding

Li Yang

Oblivious transfer protocols (R-OT and OT$_{1}^{2}$) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT$_{1}^{2}$ are constructed. Although these OT protocols are all unconditional secure, the bit commitment protocols based on OT protocols are not secure against attack similar to that presented by no-go theorem.

arXiv:1306.5863•Jun 25, 2013•6 citations

Quantum bit commitment from a physical assumption

Louis Salvail

Lecture notes in computer science•Jan 1, 1998•27 citations

Unconditionally Secure Quantum m-out-of-n Oblivious Transfer

Zhide Chen, Tian-Ming Bu, Hong Ping Zhu

Crépeau constructed a quantum 1-out-of-2 oblivious transfer (OT) in 1994 based on the transmission of polarized light and the existence of the secure quantum bit commitment (QBC) protocol [3].However, Mayers [12], Lo and Chau [10] claimed the impossibility of the quantum bit commitment in 1996.In 1997, Lo showed that quantum oblivious transfer couldn't be achieved with the same reason [11].These results imply severe setback for quantum cryptography.In the 1-out-of-2 oblivious transfer, Lo claimed that to prevent a dishonest Alice from learning anything, the reduced density matrices in Alice's hand for two cases must be the same.This requirement is too strong.In this paper, we find that to prevent a dishonest Alice from leaning anything, the qubits that Alice receives is encoded by different bases, Alice can learn nothing from them, just like the eavesdropper in the scheme BB84, cannot distinguish the photos encoded in two different bases [4].We construct a unconditionally secure quantum oblivious transfer using the secure property of quantum key distribution (QKD) [4].It bypasses Lo's attack.Furthermore, m-out-of-n quantum oblivious transfer, a more general oblivious transfer, is constructed.Finally, We show that quantum bit commitment can be constructed using QOT.

arXiv:quant-ph/0401057•Jan 11, 2004•0 citations
Oblivious transfer (OT) and bit commitment (BC) are two-party cryptographic protocols which play crucial roles in the construction of various cryptographic protocols. We propose three practical quantum cryptographic protocols in this paper. We first construct a practical quantum random oblivious transfer (R-OT) protocol based on the fact that non-orthogonal states cannot be reliably distinguished. Then, we construct a fault-tolerant one-out-of-two oblivious transfer ( O T 1 2 ) protocol based on the quantum R-OT protocol. Afterwards, we propose a quantum bit commitment (QBC) protocol which executes the fault-tolerant O T 1 2 several times. Mayers, Lo and Chau (MLC) no-go theorem proves that QBC protocol cannot be unconditionally secure. However, we find that computing the unitary transformation of no-go theorem attack needs so many resources that it is not realistically implementable. We give a definition of physical security for QBC protocols and prove that the practical QBC we proposed is physically secure and can be implemented in the real world.
Oblivious transfer protocols (R-OT and OT12_{1}^{2}12​) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT12_{1}^{2}12​ are constructed. Although these OT protocols are all unconditional secure, the bit commitment protocols based on OT protocols are not secure against attack similar to that presented by no-go theorem.
Crépeau constructed a quantum 1-out-of-2 oblivious transfer (OT) in 1994 based on the transmission of polarized light and the existence of the secure quantum bit commitment (QBC) protocol [3].However, Mayers [12], Lo and Chau [10] claimed the impossibility of the quantum bit commitment in 1996.In 1997, Lo showed that quantum oblivious transfer couldn't be achieved with the same reason [11].These results imply severe setback for quantum cryptography.In the 1-out-of-2 oblivious transfer, Lo claimed that to prevent a dishonest Alice from learning anything, the reduced density matrices in Alice's hand for two cases must be the same.This requirement is too strong.In this paper, we find that to prevent a dishonest Alice from leaning anything, the qubits that Alice receives is encoded by different bases, Alice can learn nothing from them, just like the eavesdropper in the scheme BB84, cannot distinguish the photos encoded in two different bases [4].We construct a unconditionally secure quantum oblivious transfer using the secure property of quantum key distribution (QKD) [4].It bypasses Lo's attack.Furthermore, m-out-of-n quantum oblivious transfer, a more general oblivious transfer, is constructed.Finally, We show that quantum bit commitment can be constructed using QOT.