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:cs/0311039 · IEEE Symposium on Computers and Communications (ISCC)

Quantum m-out-of-n oblivious transfer

Zhide Chen, Hong Zhu

Published Jan 1, 2004• 5 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/iscc.2004.1358433

Related papers

Quantum Oblivious Transfer

Claude Crépeau

In a one-out-of-two oblivious transfer, a party Alice has two messages m 0, m 1 that she sends to another party Bob in such a way that he can decide to obtain either of them at his choosing, but not both. Alice never finds out which message Bob received. First introduced by Wiesner as ‘conjugate coding’, this cryptographic tool was later introduced to the world of public-key cryptography, first by Rabin (in a slightly different form) and then by Even, Goldreich and Lempel who named it after Rabin's primitive, called oblivious transfer. The one-out-of-two oblivious transfer was later shown to be extremely powerful in designing general cryptographic tools. The current paper presents a new design for a one-out-of-two oblivious transfer based on the transmission of polarized light, improving the work of Wiesner and Bennett, Brassard, Breidbart and Wiesner, and shows that the scheme is robust to general attacks.

Journal of Modern Optics•Dec 1, 1994•107 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

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

A quantum oblivious transfer protocol

Abhishek Parakh

We propose a quantum protocol for 1-out-of-2, 1-out-of-n and k-out-of-n oblivious transfer. Oblivious transfer is a counter-intuitive cryptographic primitive in which the receiver receives only the information he is authorized for, while the sender does not know what information receiver received. In 1-out-of-2 oblivious transfer, Alice sends two bits to Bob who can choose only one of them to read, while Alice does not know which bit Bob read. k-out-of-n oblivious transfer is an extension of this idea. The proposed protocols do not require any classical communication, are practical, secure and can be implemented using current technology.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 1, 2013•2 citations
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 a one-out-of-two oblivious transfer, a party Alice has two messages m 0, m 1 that she sends to another party Bob in such a way that he can decide to obtain either of them at his choosing, but not both. Alice never finds out which message Bob received. First introduced by Wiesner as ‘conjugate coding’, this cryptographic tool was later introduced to the world of public-key cryptography, first by Rabin (in a slightly different form) and then by Even, Goldreich and Lempel who named it after Rabin's primitive, called oblivious transfer. The one-out-of-two oblivious transfer was later shown to be extremely powerful in designing general cryptographic tools. The current paper presents a new design for a one-out-of-two oblivious transfer based on the transmission of polarized light, improving the work of Wiesner and Bennett, Brassard, Breidbart and Wiesner, and shows that the scheme is robust to general attacks.
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.
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.
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.
We propose a quantum protocol for 1-out-of-2, 1-out-of-n and k-out-of-n oblivious transfer. Oblivious transfer is a counter-intuitive cryptographic primitive in which the receiver receives only the information he is authorized for, while the sender does not know what information receiver received. In 1-out-of-2 oblivious transfer, Alice sends two bits to Bob who can choose only one of them to read, while Alice does not know which bit Bob read. k-out-of-n oblivious transfer is an extension of this idea. The proposed protocols do not require any classical communication, are practical, secure and can be implemented using current technology.