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

International Journal of Theoretical Physics

Flexible Quantum Oblivious Transfer

Yu‐Guang Yang, Rui Zhe Yang, Weifeng Cao, Xiu‐Bo Chen, Yi‐Hua Zhou, Wei‐Min Shi

Published Jan 9, 2017• 23 citations
Publisher
DOI
10.1007/s10773-016-3270-x

Related papers

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

Practical Quantum Oblivious Transfer

Charles H. Bennett, Gilles Brassard A, Claude Crépeau +1 more

Springer eBooks•Aug 11, 2007•222 citations

Quantum Oblivious Transfer for Universal Function

Yu‐Guang Yang, Bo Zhou, Guang‐Bao Xu +5 more

ABSTRACT Oblivious transfer (OT) is an important two‐party cryptographic primitive, and it is a universal building block for secure multiparty computation. In this paper, we for the first time introduce the notion of oblivious transfer for universal function (UFOT), where the sender Alice has two bits (, ) , and the receiver Bob obtains either the first bit , the second bit , or their function . Bob should not learn anything more than this, and Alice should not learn what Bob has learnt. To show the feasibility of this concept, we implement a quantum UFOT protocol based on oblivious quantum key distribution, and then analyze its security. We also show its advantages, such as lower cheating probabilities for two parties, loss tolerance, flexibility, and universality. It paves the way for solving privacy‐preserving machine learning problems.

Advanced Quantum Technologies•Dec 17, 2025•2 citations

consideration of quantum Oblivious Transfer

Atsushi Waseda, Takayuki TAKAGI, Masakazu Soshi +1 more

IEICE Technical Report; IEICE Tech. Rep.•May 11, 2007•0 citations

Robust non-interactive oblivious transfer

Yi Mu, Junqi Zhang, Vijay Varadharajan +1 more

We present a novel scheme of noninteractive m out of n oblivious transfer, which demonstrates significant improvement over the existing schemes in terms of completeness, robustness and flexibility. This scheme is useful for protection of user privacy in the Internet.

IEEE Communications Letters•Apr 1, 2003•15 citations

A New Framework for Quantum Oblivious Transfer

Amit Agarwal, James Bartusek, Dakshita Khurana +1 more

arXiv:2209.04520•Lecture notes in computer science•Jan 1, 2023•12 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.
ABSTRACT Oblivious transfer (OT) is an important two‐party cryptographic primitive, and it is a universal building block for secure multiparty computation. In this paper, we for the first time introduce the notion of oblivious transfer for universal function (UFOT), where the sender Alice has two bits (, ) , and the receiver Bob obtains either the first bit , the second bit , or their function . Bob should not learn anything more than this, and Alice should not learn what Bob has learnt. To show the feasibility of this concept, we implement a quantum UFOT protocol based on oblivious quantum key distribution, and then analyze its security. We also show its advantages, such as lower cheating probabilities for two parties, loss tolerance, flexibility, and universality. It paves the way for solving privacy‐preserving machine learning problems.