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

Computers, materials & continua/Computers, materials & continua (Print)

Quantum Oblivious Transfer with Reusable Bell State

Shu–Yu Kuo, Kuo-Chun Tseng, Yao–Hsin Chou, Fan‐Hsun Tseng

Published Sep 22, 2022• 2 citations
Publisher

Abstract

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.

DOI
10.32604/cmc.2023.032320

Related papers

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

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

Practical quantum oblivious transfer with a single photon

Guang Ping He

Abstract Quantum oblivious transfer (QOT) is an essential cryptographic primitive, but unconditionally secure QOT is known to be impossible. Here, we propose a practical QOT protocol which is perfectly secure against dishonest senders without relying on any technological assumptions. It is also secure against dishonest receivers in the absence of long-term quantum memory and complicated collective measurements. The protocol is extremely feasible, as it can be implemented using currently available Mach–Zehnder interferometers, and no quantum memory, collective measurements, or entanglement are needed for honest participants. More importantly, compared with other practical QOT schemes, our protocol has an unbeatable efficiency since it requires the transmission of a single photon only.

arXiv:1805.00513•Laser Physics•Feb 12, 2019•6 citations

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

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

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
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.
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.
Abstract Quantum oblivious transfer (QOT) is an essential cryptographic primitive, but unconditionally secure QOT is known to be impossible. Here, we propose a practical QOT protocol which is perfectly secure against dishonest senders without relying on any technological assumptions. It is also secure against dishonest receivers in the absence of long-term quantum memory and complicated collective measurements. The protocol is extremely feasible, as it can be implemented using currently available Mach–Zehnder interferometers, and no quantum memory, collective measurements, or entanglement are needed for honest participants. More importantly, compared with other practical QOT schemes, our protocol has an unbeatable efficiency since it requires the transmission of a single photon only.
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.
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
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.