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/0408108

Statistically Secure Quantum Oblivious Transfer

Zhide Chen, Tian-Ming Bu, Hong Ping Zhu

Published Aug 17, 2004• 1 citation
arXivHTMLPDF

Abstract

In 1997, Lo claimed that Quantum Oblivious Transfer (QOT) is impossible. The result implies severe setback for quantum cryptography. However, it is based on a hypothesis. i.e. to prevent Alice from learning Bob's choice in the scheme, the reduced density matrices in Alice's hand for the two cases must be the same. Actually, to prevent Alice from learning his choice, Bob can send the qubits built in different bases, Base0 and Base1, one would let him to get $b_0$, the other one would let him to get $b_1$. In this paper, we construct a Statistically-Secure Quantum 1-out-of-2 Oblivious Transfer, which bypasses the attack of Lo.

DOI
10.48550/arxiv.quant-ph/0408108

Related papers

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

Quantum Oblivious Transfer Using Tripartite Entangled States

Wei Yang, Liusheng Huang, Yifei Yao +1 more

Oblivious transfer is an interesting cryptographic task in which one party Alice aims to transfer one of her two bits to the other party Bob, with the assurance that he can choose freely his bit, but is not able to obtain the two bits simultaneously. Bob on the other hand wants to be sure that Alice should not be capable of inferring what bit he has chosen. Quantum oblivious transfer (QOT) scheme outperforms its classical counterpart for its higher security and eavesdropping detecting ability. In this paper, we present a new and novel QOT protocol based on tripartite entangled states, which can be proven to be secure against any quantum attacking strategy allowed by physical laws.

International Conference on Future Generation Communication and Networking•Jan 1, 2007•2 citations

1-out-of-2 oblivious transfer using a flawed bit-string quantum protocol

Martin Plesch, Marcin Pawłowski, Matej Pivoluska

Oblivious transfer (OT) is an important tool in cryptography. It serves as a subroutine to other complex procedures of both theoretical and practical significance. A common attribute of OT protocols is that one party (Alice) has to send a message to another party (Bob) and has to stay oblivious to whether Bob did receive the message. Specific (OT) protocols vary by exact definition of the task---in the all-or-nothing protocol, Alice sends a single bit-string message, which Bob is able to read with only $50%$ probability, whereas in a 1-out-of-2 OT protocol Bob reads one out of two messages sent by Alice. These two flavors of protocol are known to be equivalent. Recently, a computationally secure all-or-nothing OT protocol based on quantum states was developed by A. Souto et al. [Phys. Rev. A 91, 042306 (2015)], which, however, cannot be reduced to a 1-out-of-2 OT protocol by standard means. Here we present an elaborate reduction of this protocol that retains the security of the original.

arXiv:1611.10087•Physical Review A•Apr 18, 2017•7 citations

Quantum m-out-of-n oblivious transfer

Zhide Chen, Hong Zhu

In the m-out-of-n oblivious transfer (OT) model, one party Alice sends n bits to another party Bob, Bob can get only m bits from the n bits. However, Alice cannot know which m bits Bob received. Y. Mu and Naor presented classical m-out-of-n oblivious transfer based on discrete logarithm. As the work of Shor, the discrete logarithm can be solved in polynomial time by quantum computers, so such OTs are unsecure to the quantum computer. In this paper, we construct a quantum m-out-of-n OT (QOT) scheme based on the transmission of polarized light and show that the scheme is robust to general attacks, i.e. the QOT scheme satisfies statistical correctness and statistical privacy.

arXiv:cs/0311039•IEEE Symposium on Computers and Communications (ISCC)•Jan 1, 2004•5 citations

Quantum Oblivious Transfer with Reusable Bell State

Shu–Yu Kuo, Kuo-Chun Tseng, Yao–Hsin Chou +1 more

In cryptography, oblivious transfer (OT) is an important multi-party cryptographic primitive and protocol, that is suitable for many upper-layer applications, such as secure computation, remote coin-flipping, electrical contract signing and exchanging secrets simultaneously. However, some no-go theorems have been established, indicating that one-out-of-two quantum oblivious transfer (QOT) protocols with unconditional security are impossible. Fortunately, some one-out-of-two QOT protocols using the concept of Crépeau’s reduction have been demonstrated not to conform to Lo’s no-go theorem, but these protocols require more quantum resources to generate classical keys using all-or-nothing QOT to construct one-out-of-two QOT. This paper proposes a novel and efficient one-out-of-two QOT which uses quantum resources directly instead of wasting unnecessary resources to generate classical keys. The proposed protocol is not covered by Lo’s no-go theorem, and it is able to check the sender’s loyalty and avoid the attack from the receiver. Moreover, the entangled state of the proposed protocol is reusable, so it can provide more services for the participants when necessary. Compared with other QOT protocols, the proposed protocol is more secure, efficient, and flexible, which not only can prevent external and internal attacks, but also reduce the required resources and resource distribution time.

Computers, materials & continua/Computers, materials & continua (Print)•Sep 22, 2022•2 citations

One-out-of-two Quantum Oblivious Transfer based on Nonorthogonal States

Yao–Hsin Chou, Guo-Jyun Zeng, Shu–Yu Kuo

This research proposes the first one-out-of-two quantum oblivious transfer (QOT) scheme that does not have a two-level structure and is not subject to Lo's no-go theorem. Instead, the proposed scheme is a simple and efficient approach based on nonorthogonal states. The nonorthogonality causes one of a pair of messages to be unable to be measured to achieve the irreversible goal of discarding a message, resulting in a one-out-of-two selection effect. The proposed QOT protocol is therefore built directly on quantum resources rather than on a two-level structure in which two classical keys must first be created using quantum resources (all-or-nothing QOT) and then a one-out-of-two protocol is built from there. Furthermore, the proposed protocol allows Alice and Bob to test each other's loyalty by comparing measurement results. In addition, the relationship with the no-go theorem is discussed in detail; this relationship is often overlooked in other studies. A security analysis demonstrates that the proposed protocol is secure against both external and internal attacks. In addition, an efficiency analysis shows that the proposed protocol is more efficient than other, two-level-structured protocols.

arXiv:1707.06062•Scientific Reports•Oct 23, 2018•11 citations
In 1997, Lo claimed that Quantum Oblivious Transfer (QOT) is impossible. The result implies severe setback for quantum cryptography. However, it is based on a hypothesis. i.e. to prevent Alice from learning Bob's choice in the scheme, the reduced density matrices in Alice's hand for the two cases must be the same. Actually, to prevent Alice from learning his choice, Bob can send the qubits built in different bases, Base0 and Base1, one would let him to get b0b_0b0​, the other one would let him to get b1b_1b1​. In this paper, we construct a Statistically-Secure Quantum 1-out-of-2 Oblivious Transfer, which bypasses the attack of Lo.
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.
Oblivious transfer is an interesting cryptographic task in which one party Alice aims to transfer one of her two bits to the other party Bob, with the assurance that he can choose freely his bit, but is not able to obtain the two bits simultaneously. Bob on the other hand wants to be sure that Alice should not be capable of inferring what bit he has chosen. Quantum oblivious transfer (QOT) scheme outperforms its classical counterpart for its higher security and eavesdropping detecting ability. In this paper, we present a new and novel QOT protocol based on tripartite entangled states, which can be proven to be secure against any quantum attacking strategy allowed by physical laws.
Oblivious transfer (OT) is an important tool in cryptography. It serves as a subroutine to other complex procedures of both theoretical and practical significance. A common attribute of OT protocols is that one party (Alice) has to send a message to another party (Bob) and has to stay oblivious to whether Bob did receive the message. Specific (OT) protocols vary by exact definition of the task---in the all-or-nothing protocol, Alice sends a single bit-string message, which Bob is able to read with only 5050%50 probability, whereas in a 1-out-of-2 OT protocol Bob reads one out of two messages sent by Alice. These two flavors of protocol are known to be equivalent. Recently, a computationally secure all-or-nothing OT protocol based on quantum states was developed by A. Souto et al. [Phys. Rev. A 91, 042306 (2015)], which, however, cannot be reduced to a 1-out-of-2 OT protocol by standard means. Here we present an elaborate reduction of this protocol that retains the security of the original.
In the m-out-of-n oblivious transfer (OT) model, one party Alice sends n bits to another party Bob, Bob can get only m bits from the n bits. However, Alice cannot know which m bits Bob received. Y. Mu and Naor presented classical m-out-of-n oblivious transfer based on discrete logarithm. As the work of Shor, the discrete logarithm can be solved in polynomial time by quantum computers, so such OTs are unsecure to the quantum computer. In this paper, we construct a quantum m-out-of-n OT (QOT) scheme based on the transmission of polarized light and show that the scheme is robust to general attacks, i.e. the QOT scheme satisfies statistical correctness and statistical privacy.
In cryptography, oblivious transfer (OT) is an important multi-party cryptographic primitive and protocol, that is suitable for many upper-layer applications, such as secure computation, remote coin-flipping, electrical contract signing and exchanging secrets simultaneously. However, some no-go theorems have been established, indicating that one-out-of-two quantum oblivious transfer (QOT) protocols with unconditional security are impossible. Fortunately, some one-out-of-two QOT protocols using the concept of Crépeau’s reduction have been demonstrated not to conform to Lo’s no-go theorem, but these protocols require more quantum resources to generate classical keys using all-or-nothing QOT to construct one-out-of-two QOT. This paper proposes a novel and efficient one-out-of-two QOT which uses quantum resources directly instead of wasting unnecessary resources to generate classical keys. The proposed protocol is not covered by Lo’s no-go theorem, and it is able to check the sender’s loyalty and avoid the attack from the receiver. Moreover, the entangled state of the proposed protocol is reusable, so it can provide more services for the participants when necessary. Compared with other QOT protocols, the proposed protocol is more secure, efficient, and flexible, which not only can prevent external and internal attacks, but also reduce the required resources and resource distribution time.
This research proposes the first one-out-of-two quantum oblivious transfer (QOT) scheme that does not have a two-level structure and is not subject to Lo's no-go theorem. Instead, the proposed scheme is a simple and efficient approach based on nonorthogonal states. The nonorthogonality causes one of a pair of messages to be unable to be measured to achieve the irreversible goal of discarding a message, resulting in a one-out-of-two selection effect. The proposed QOT protocol is therefore built directly on quantum resources rather than on a two-level structure in which two classical keys must first be created using quantum resources (all-or-nothing QOT) and then a one-out-of-two protocol is built from there. Furthermore, the proposed protocol allows Alice and Bob to test each other's loyalty by comparing measurement results. In addition, the relationship with the no-go theorem is discussed in detail; this relationship is often overlooked in other studies. A security analysis demonstrates that the proposed protocol is secure against both external and internal attacks. In addition, an efficiency analysis shows that the proposed protocol is more efficient than other, two-level-structured protocols.