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

Physical Review A

Quantum oblivious transfer for quantum messages

Yu‐Guang Yang, Shi Qiu, Yan Chang, Guang‐Bao Xu, Dong‐Huan Jiang, Dan Li

Published Sep 8, 2025• 4 citations
Publisher

Abstract

Oblivious transfer (OT) is an essential building block for secure multiparty computation. Up to now, one- and two-server OT protocols have been investigated. It has been proven that unconditionally secure one-server OT is impossible even with the quantum system. Recently, Hayashi and Song proposed the first two-server OT protocol for quantum messages [Adv. Quantum Technol. 7, 2300184 (2024)], which is the only one for two-server OT for quantum messages to our knowledge. This protocol has the assumption that two quantum servers do not communicate with each other. However, it is unrealistic to make such an assumption. In addition, an equation error occurs in the protocol description. To tackle these issues, we first point out the equation error existent in the protocol of Hayashi and Song and correct it. Then, we propose a two-server OT protocol for quantum messages by using entanglement swapping. Security analysis shows that the user privacy holds even if the two quantum servers communicate mutually.

DOI
10.1103/8963-6537

Related papers

Two‐Server Oblivious Transfer for Quantum Messages

Masahito Hayashi, Seunghoan Song

Abstract Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over a quantum network. It is an essential building block for secure multiparty computation. It is known that one‐server oblivious transfer is impossible. When the task is the transmission of classical messages, protocols for two‐server oblivious transfer exist, i.e., existing protocols work under the assumption that two servers do not communicate with each other. However, when the task is the transmission of a quantum state, no existing method works even under the above two‐server assumption. Two‐server oblivious transfer protocols for quantum messages are proposed for the first time.

arXiv:2211.03308•Advanced Quantum Technologies•Feb 8, 2024•2 citations

Counterfactual All‐Or‐Nothing Oblivious Transfer for Quantum Messages

Xiao‐Qiu Cai, Yu‐Guang Yang, Tian‐Yin Wang +2 more

Abstract Oblivious transfer (OT) protocol is an essential building block for secure multiparty computation. The transmission of quantum messages is conductive in executing complex secure multiparty quantum computation tasks and even distributed quantum computation tasks. However, as an important form of OT protocol, existing all‐or‐nothing OT protocols only work for the transmission of classical messages thus limiting application scenarios. To tackle this issue, a counterfactual all‐or‐nothing OT protocol is proposed for quantum messages. Compared with existing all‐or‐nothing OT protocols for classical messages, the proposed protocol has three advantages: i) it is achieved without any physical particles traveling between the sender and the receiver thus reducing the communication complexity; ii) no prior entanglement between the sender and the receiver is required thus facilitating protocol implementation, and iii) it works for known even unknown quantum messages thereby offering broader application scenarios.

Advanced Quantum Technologies•Jan 6, 2025•10 citations

Computationally Secure Quantum Oblivious Transfer

Ping Wang, Rui Zhang, Guohao Jiang +1 more

Abstract Oblivious transfer (OT) is one of the cornerstones of secure multiparty computation. It is clear that unconditionally secure OT is impossible. Any protocol for OT requires computational assumptions, such as number‐theoretic cryptographic assumptions or the assumptions of existence of one‐way functions. On the other hand, it is broadly believed that one‐way functions alone do not promise secure OT. However, in this paper, a novel computationally secure quantum oblivious transfer (QOT) protocol is proposed with the help of quantum channels under the minimum assumption requirements: the existence of one‐way functions.

Advanced Quantum Technologies•Nov 19, 2021•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 and classical oblivious transfer: A comparative analysis

Manuel B. Santos, Armando N. Pinto, Paulo Mateus

Abstract Secure multiparty computation has the potential to be a disruptive technique in the realm of data analysis and computation. It enables several parties to compute virtually any function while preserving the privacy of their inputs. However, most of its protocols’ security and efficiency relies on the security and efficiency of oblivious transfer (OT). In this work, we make a detailed comparison between the complexity of the hybrid quantum oblivious transfer (HQOT) protocol presented in [11] and the classical OT [12], which to the best of our knowledge, is the fastest OT protocol. We also propose an optimised version of HQOT and discuss several other OT protocols generated from oblivious keys.

IET Quantum Communication•May 21, 2021•11 citations

Unconditionally Secure Quantum Oblivious Transfer

Guoliang Chen

As a basic protocol of Secure Multi-party Computation,Oblivious Transfer(OT) is of significant research and application value.Most of previous oblivious transfer protocols in classical environment rely either on public-key cryptography or on additional computational assumptions which will be very vulnerable under quantum mechanics.Based on the characteristics of Bell States,a new quantum oblivious transfer protocol is proposed in this paper.The correctness and security of the protocol are analyzed and proved.The protocol is secure in the presence of noise on the channel and a potential eavesdropper.Comparing with oblivious transfer protocols in classical computational environment,the protocol in this paper is superior in security,soundness and wire-tapping detecting.

Dianzi xuebao•Jan 1, 2007•0 citations
Oblivious transfer (OT) is an essential building block for secure multiparty computation. Up to now, one- and two-server OT protocols have been investigated. It has been proven that unconditionally secure one-server OT is impossible even with the quantum system. Recently, Hayashi and Song proposed the first two-server OT protocol for quantum messages [Adv. Quantum Technol. 7, 2300184 (2024)], which is the only one for two-server OT for quantum messages to our knowledge. This protocol has the assumption that two quantum servers do not communicate with each other. However, it is unrealistic to make such an assumption. In addition, an equation error occurs in the protocol description. To tackle these issues, we first point out the equation error existent in the protocol of Hayashi and Song and correct it. Then, we propose a two-server OT protocol for quantum messages by using entanglement swapping. Security analysis shows that the user privacy holds even if the two quantum servers communicate mutually.
Abstract Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over a quantum network. It is an essential building block for secure multiparty computation. It is known that one‐server oblivious transfer is impossible. When the task is the transmission of classical messages, protocols for two‐server oblivious transfer exist, i.e., existing protocols work under the assumption that two servers do not communicate with each other. However, when the task is the transmission of a quantum state, no existing method works even under the above two‐server assumption. Two‐server oblivious transfer protocols for quantum messages are proposed for the first time.
Abstract Oblivious transfer (OT) protocol is an essential building block for secure multiparty computation. The transmission of quantum messages is conductive in executing complex secure multiparty quantum computation tasks and even distributed quantum computation tasks. However, as an important form of OT protocol, existing all‐or‐nothing OT protocols only work for the transmission of classical messages thus limiting application scenarios. To tackle this issue, a counterfactual all‐or‐nothing OT protocol is proposed for quantum messages. Compared with existing all‐or‐nothing OT protocols for classical messages, the proposed protocol has three advantages: i) it is achieved without any physical particles traveling between the sender and the receiver thus reducing the communication complexity; ii) no prior entanglement between the sender and the receiver is required thus facilitating protocol implementation, and iii) it works for known even unknown quantum messages thereby offering broader application scenarios.
Abstract Oblivious transfer (OT) is one of the cornerstones of secure multiparty computation. It is clear that unconditionally secure OT is impossible. Any protocol for OT requires computational assumptions, such as number‐theoretic cryptographic assumptions or the assumptions of existence of one‐way functions. On the other hand, it is broadly believed that one‐way functions alone do not promise secure OT. However, in this paper, a novel computationally secure quantum oblivious transfer (QOT) protocol is proposed with the help of quantum channels under the minimum assumption requirements: the existence of one‐way functions.
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
Abstract Secure multiparty computation has the potential to be a disruptive technique in the realm of data analysis and computation. It enables several parties to compute virtually any function while preserving the privacy of their inputs. However, most of its protocols’ security and efficiency relies on the security and efficiency of oblivious transfer (OT). In this work, we make a detailed comparison between the complexity of the hybrid quantum oblivious transfer (HQOT) protocol presented in [11] and the classical OT [12], which to the best of our knowledge, is the fastest OT protocol. We also propose an optimised version of HQOT and discuss several other OT protocols generated from oblivious keys.
As a basic protocol of Secure Multi-party Computation,Oblivious Transfer(OT) is of significant research and application value.Most of previous oblivious transfer protocols in classical environment rely either on public-key cryptography or on additional computational assumptions which will be very vulnerable under quantum mechanics.Based on the characteristics of Bell States,a new quantum oblivious transfer protocol is proposed in this paper.The correctness and security of the protocol are analyzed and proved.The protocol is secure in the presence of noise on the channel and a potential eavesdropper.Comparing with oblivious transfer protocols in classical computational environment,the protocol in this paper is superior in security,soundness and wire-tapping detecting.