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

Applied Sciences

Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer

Yaqi Song, Li Yang

Published Oct 19, 2018• 8 citations
Publisher

Abstract

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.

DOI
10.3390/app8101990

Related papers

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

Oblivious transfer using quantum entanglement

Guang Ping He, Z. D. Wang

Based on quantum entanglement, an all-or-nothing oblivious transfer (OT) protocol is proposed and is proven to be secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. More intriguingly, this OT protocol does not belong to a class of protocols denied by Lo's no-go theorem of one-sided two-party secure computation, and thus its security can be achieved.

arXiv:quant-ph/0312161•Physical Review A•Jan 23, 2006•45 citations

Communication channels analogous to one out of two oblivious transfers based on quantum uncertainty

Kaoru Shimizu, Nobuyuki Imoto

This paper proposes a cryptographic quantum communication scheme analogous to one out of two oblivious transfers based on quantum conjugate coding defined in a four-dimensional Hilbert space. The quantum uncertainty principle ensures that our scheme can satisfy the following two conditions: (i) a sender, Bob, can encode two bits of information $X\ensuremath{\in}{0,1}$ and $Y\ensuremath{\in}{0,1},$ but a receiver, Alice, can only obtain either X or Y dependent on her choice; and (ii) honest Bob, who attempts to encode $(X,Y),$ cannot reveal Alice's choice. By contrast, when malicious Bob tries to reveal her choice, honest Alice can detect malicious Bob with a finite probability. Moreover, by using our proposed scheme many times, we can construct a protocol for quantum bit commitment (QBC) from Alice to Bob. Contrary to common belief, the security of our QBC protocol may not be violated by the well-known no-go theorem of QBC. This is because our QBC protocol does not meet the assumptions in which the no-go theorem holds.

Physical Review A•Nov 22, 2002•10 citations

Unconditionally secure quantum oblivious transfer

Guang-Ping He, Z. D. Wang

Based on quantum uncertainty and quantum entanglement, an quantum allor-nothing oblivious transfer protocol is proposed. It is illustrated in detail that the protocol is unconditionally secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. The full utilization of the entanglement makes the protocol different from previous insecure ones, thus its security is not restricted by the no-go theorem of twoparty secure computations. Typeset using REVTEX 1 The research on the oblivious transfer (OT) problem may be traced back to more than twenty years ago [1,2]. Kilian [3] pointed out later that OT is very important in two-party and multi-party protocols. This is because in most symmetrical protocols, the participants always know each others ’ data. If some participants are dishonest or try to get extra information, the protocols become insecure. OT can create some secret between the participants and break this symmetry. Thus it can be used to implement multi-party protocols such as

•Dec 19, 2003•0 citations

Study on Quantum Bit Commitment

Xiao Qiang Guo, Li Hong Li, Cui Ling Luo +1 more

The Bit Commitment (BC) is an important basic agreement in cryptography . The concept was first proposed by the winner of the Turing Award in 1995 ManuelBlum. Bit commitment scheme can be used to build up zero knowledge proof, verified secret sharing, throwing coins etc agreement.Simultaneously and Oblivious Transfer together constitute the basis of secure multi-party computations. Both of them are hotspots in the field of information security. We investigated unconditional secure Quantum Bit Commitment (QBC) existence. And we constructed a new bit commitment model – double prover bit commitment. The Quantum Bit Commitment Protocol can be resistant to errors caused by noise.

Applied Mechanics and Materials•Dec 1, 2012•0 citations

Secure quantum bit commitment against empty promises

Guang Ping He

The existence of unconditionally secure quantum bit commitment (QBC) is excluded by the Mayers-Lo-Chau no-go theorem. Here we look for the second-best: a QBC protocol that can defeat certain quantum attacks. By breaking the knowledge symmetry between the participants with quantum algorithm, a QBC protocol is proposed and is proven to be secure against a major kind of coherent attacks---the dummy attack, in which the participant makes an empty promise instead of committing to a specific bit. Therefore it surpasses previous QBC protocols which are secure against individual attacks only.

Physical Review A•Aug 31, 2006•14 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.
This paper proposes a cryptographic quantum communication scheme analogous to one out of two oblivious transfers based on quantum conjugate coding defined in a four-dimensional Hilbert space. The quantum uncertainty principle ensures that our scheme can satisfy the following two conditions: (i) a sender, Bob, can encode two bits of information $X\ensuremath{\in}{0,1}$ and $Y\ensuremath{\in}{0,1},$ but a receiver, Alice, can only obtain either X or Y dependent on her choice; and (ii) honest Bob, who attempts to encode (X,Y),(X,Y),(X,Y), cannot reveal Alice's choice. By contrast, when malicious Bob tries to reveal her choice, honest Alice can detect malicious Bob with a finite probability. Moreover, by using our proposed scheme many times, we can construct a protocol for quantum bit commitment (QBC) from Alice to Bob. Contrary to common belief, the security of our QBC protocol may not be violated by the well-known no-go theorem of QBC. This is because our QBC protocol does not meet the assumptions in which the no-go theorem holds.
Based on quantum uncertainty and quantum entanglement, an quantum allor-nothing oblivious transfer protocol is proposed. It is illustrated in detail that the protocol is unconditionally secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. The full utilization of the entanglement makes the protocol different from previous insecure ones, thus its security is not restricted by the no-go theorem of twoparty secure computations. Typeset using REVTEX 1 The research on the oblivious transfer (OT) problem may be traced back to more than twenty years ago [1,2]. Kilian [3] pointed out later that OT is very important in two-party and multi-party protocols. This is because in most symmetrical protocols, the participants always know each others ’ data. If some participants are dishonest or try to get extra information, the protocols become insecure. OT can create some secret between the participants and break this symmetry. Thus it can be used to implement multi-party protocols such as
The Bit Commitment (BC) is an important basic agreement in cryptography . The concept was first proposed by the winner of the Turing Award in 1995 ManuelBlum. Bit commitment scheme can be used to build up zero knowledge proof, verified secret sharing, throwing coins etc agreement.Simultaneously and Oblivious Transfer together constitute the basis of secure multi-party computations. Both of them are hotspots in the field of information security. We investigated unconditional secure Quantum Bit Commitment (QBC) existence. And we constructed a new bit commitment model – double prover bit commitment. The Quantum Bit Commitment Protocol can be resistant to errors caused by noise.
The existence of unconditionally secure quantum bit commitment (QBC) is excluded by the Mayers-Lo-Chau no-go theorem. Here we look for the second-best: a QBC protocol that can defeat certain quantum attacks. By breaking the knowledge symmetry between the participants with quantum algorithm, a QBC protocol is proposed and is proven to be secure against a major kind of coherent attacks---the dummy attack, in which the participant makes an empty promise instead of committing to a specific bit. Therefore it surpasses previous QBC protocols which are secure against individual attacks only.