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

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

Zhide Chen, Tian-Ming Bu, Hong Ping Zhu

Published Jan 11, 2004• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0401057

Related papers

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

Statistically Secure Quantum Oblivious Transfer

Zhide Chen, Tian-Ming Bu, Hong Ping Zhu

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.

arXiv:quant-ph/0408108•Aug 17, 2004•1 citation

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

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 Based on POVM Measurements.

Wei Yang, Liusheng Huang, Yonglong Luo +1 more

Abstract- Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any information about the other bit. Alice on the other hand does not obtain any information about Bob’s choice. We present a new technique for the same task in quantum environment, based on POVM measurements. It is shown that our method has two important advantages over the previous approaches. First, it is unconditionally secure without invoking a commitment scheme, and second, it is more efficient in terms of communication complexity. Key words: Oblivious transfer, POVM measurements, Unconditional security

FCS•Jan 1, 2006•0 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
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 (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.
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.
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.
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.
Abstract- Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any information about the other bit. Alice on the other hand does not obtain any information about Bob’s choice. We present a new technique for the same task in quantum environment, based on POVM measurements. It is shown that our method has two important advantages over the previous approaches. First, it is unconditionally secure without invoking a commitment scheme, and second, it is more efficient in terms of communication complexity. Key words: Oblivious transfer, POVM measurements, Unconditional security
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