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

Applied Mechanics and Materials

Study on Quantum Oblivious Transfer

Xiao Qiang Guo, Yan Yan, Hong Wang, Yi Shuo Shi

Published Dec 1, 2012• 0 citations
Publisher

Abstract

The Oblivious Transfer (OT) is a typical foundation agreement of secure multi-party computations. It can be used to solve the “ Millionaire” interesting question raised by the winner of the Turing Award in 1982, Mr. Yao , thus to build more complex secure multi-party computation protocol or to solve practical problems,such as electronic voting, elections, e-commerce. Using of the quantum channel and the principles of the quantum mechanics , Quantum Oblivious Transfer (QOT) can be solve the classic oblivious transfer problems. QOT can be achieved higher security and higher efficiency than the Classic Oblivious Transfer, while it also has a unique advantage in found eavesdropping. We had given a very novel QOT scheme based on three-particle entangled states. Although the use more particles , the process is better concise.

DOI
10.4028/www.scientific.net/amm.263-266.3079

Related papers

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

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

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

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

Experimental secure multiparty computation from quantum oblivious transfer with bit commitment

Kaiyi Zhang, An-Jing Huang, Kun Tu +5 more

Secure multiparty computation enables collaborative computations across multiple users while preserving individual privacy, which has a wide range of applications in finance, machine learning and healthcare. Secure multiparty computation can be realized using oblivious transfer as a primitive function. In this paper, we present an experimental implementation of a quantum-secure quantum oblivious transfer (QOT) protocol using an adapted quantum key distribution system combined with a bit commitment scheme, surpassing previous approaches only secure in the noisy storage model. We demonstrate the first practical application of the QOT protocol by solving the private set intersection, a prime example of secure multiparty computation, where two parties aim to find common elements in their datasets without revealing any other information. In our experiments, two banks can identify common suspicious accounts without disclosing any other data. This not only proves the experimental functionality of QOT, but also showcases its real-world commercial applications.

arXiv:2411.04558•npj Quantum Information•Mar 14, 2026•0 citations
The Oblivious Transfer (OT) is a typical foundation agreement of secure multi-party computations. It can be used to solve the “ Millionaire” interesting question raised by the winner of the Turing Award in 1982, Mr. Yao , thus to build more complex secure multi-party computation protocol or to solve practical problems,such as electronic voting, elections, e-commerce. Using of the quantum channel and the principles of the quantum mechanics , Quantum Oblivious Transfer (QOT) can be solve the classic oblivious transfer problems. QOT can be achieved higher security and higher efficiency than the Classic Oblivious Transfer, while it also has a unique advantage in found eavesdropping. We had given a very novel QOT scheme based on three-particle entangled states. Although the use more particles , the process is better concise.
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.
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.
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.
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.
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.
Secure multiparty computation enables collaborative computations across multiple users while preserving individual privacy, which has a wide range of applications in finance, machine learning and healthcare. Secure multiparty computation can be realized using oblivious transfer as a primitive function. In this paper, we present an experimental implementation of a quantum-secure quantum oblivious transfer (QOT) protocol using an adapted quantum key distribution system combined with a bit commitment scheme, surpassing previous approaches only secure in the noisy storage model. We demonstrate the first practical application of the QOT protocol by solving the private set intersection, a prime example of secure multiparty computation, where two parties aim to find common elements in their datasets without revealing any other information. In our experiments, two banks can identify common suspicious accounts without disclosing any other data. This not only proves the experimental functionality of QOT, but also showcases its real-world commercial applications.