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/0504170 · Physical Review A

Nonequivalence of two flavors of oblivious transfer at the quantum level

Guang Ping He, Z. D. Wang

Published Apr 26, 2006• 17 citations
arXivHTMLPDF

Abstract

Though all-or-nothing oblivious transfer and one-out-of-two oblivious transfer are equivalent in classical cryptography, we here show that a protocol built upon secure quantum all-or-nothing oblivious transfer cannot satisfy the rigorous definition of quantum one-out-of-two oblivious transfer due to the nature of quantum cryptography. Thus the securities of the two oblivious transfer protocols are not equivalent at the quantum level.

DOI
10.1103/physreva.73.044304

Related papers

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

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

All-or-nothing oblivious transfer based on the quantum one-way function

Ping Wang, Yiting Su, Zhiwei Sun

Oblivious transfer (OT) is one of the keystones of secure multi-party computation. It is generally believed that unconditionally secure OT is impossible. In this article, we propose a practical and secure quantum all-or-nothing oblivious transfer protocol based on the quantum one-way function. The protocol is built upon a quantum public-key encryption construction, and its security relies on the no-cloning theorem and no-communication theorem. Practical security is reflected in limitations on non-demolition measurements.

Frontiers in Physics•Aug 9, 2022•4 citations

Quantum Oblivious Transfer: A Short Review

Manuel Batalha dos Santos, Paulo Mateus, Armando N. Pinto

Quantum cryptography is the field of cryptography that explores the quantum properties of matter. Generally, it aims to develop primitives beyond the reach of classical cryptography and to improve existing classical implementations. Although much of the work in this field covers quantum key distribution (QKD), there have been some crucial steps towards the understanding and development of quantum oblivious transfer (QOT). One can show the similarity between the application structure of both QKD and QOT primitives. Just as QKD protocols allow quantum-safe communication, QOT protocols allow quantum-safe computation. However, the conditions under which QOT is fully quantum-safe have been subject to intense scrutiny and study. In this review article, we survey the work developed around the concept of oblivious transfer within theoretical quantum cryptography. We focus on some proposed protocols and their security requirements. We review the impossibility results that daunt this primitive and discuss several quantum security models under which it is possible to prove QOT security.

arXiv:2206.03313•Entropy•Jul 7, 2022•31 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

A Weak Quantum Oblivious Transfer

Kai-Yuen Cheong, Min-Hsiu Hsieh, Takeshi Koshiba

Due to the commonly known impossibility results, information theoretic security is considered impossible for oblivious transfer (OT) in both the classical and the quantum world. In this paper, we proposed a weak version of the all-or-nothing OT. In our protocol the honest parties do not need long term quantum memory, entanglements, or sophisticated quantum computations. We observe some difference between the classical and quantum OT impossibilities.

arXiv:1010.0702•Oct 4, 2010•2 citations
Though all-or-nothing oblivious transfer and one-out-of-two oblivious transfer are equivalent in classical cryptography, we here show that a protocol built upon secure quantum all-or-nothing oblivious transfer cannot satisfy the rigorous definition of quantum one-out-of-two oblivious transfer due to the nature of quantum cryptography. Thus the securities of the two oblivious transfer protocols are not equivalent at the quantum level.
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.
Oblivious transfer (OT) is one of the keystones of secure multi-party computation. It is generally believed that unconditionally secure OT is impossible. In this article, we propose a practical and secure quantum all-or-nothing oblivious transfer protocol based on the quantum one-way function. The protocol is built upon a quantum public-key encryption construction, and its security relies on the no-cloning theorem and no-communication theorem. Practical security is reflected in limitations on non-demolition measurements.
Quantum cryptography is the field of cryptography that explores the quantum properties of matter. Generally, it aims to develop primitives beyond the reach of classical cryptography and to improve existing classical implementations. Although much of the work in this field covers quantum key distribution (QKD), there have been some crucial steps towards the understanding and development of quantum oblivious transfer (QOT). One can show the similarity between the application structure of both QKD and QOT primitives. Just as QKD protocols allow quantum-safe communication, QOT protocols allow quantum-safe computation. However, the conditions under which QOT is fully quantum-safe have been subject to intense scrutiny and study. In this review article, we survey the work developed around the concept of oblivious transfer within theoretical quantum cryptography. We focus on some proposed protocols and their security requirements. We review the impossibility results that daunt this primitive and discuss several quantum security models under which it is possible to prove QOT 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