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

FCS

Quantum Oblivious Transfer Based on POVM Measurements.

Wei Yang, Liusheng Huang, Yonglong Luo, Mingjun Xiao

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

Abstract- Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any information about the other bit. Alice on the other hand does not obtain any information about Bob’s choice. We present a new technique for the same task in quantum environment, based on POVM measurements. It is shown that our method has two important advantages over the previous approaches. First, it is unconditionally secure without invoking a commitment scheme, and second, it is more efficient in terms of communication complexity. Key words: Oblivious transfer, POVM measurements, Unconditional security

Related papers

A quantum oblivious transfer protocol

Abhishek Parakh

We propose a quantum protocol for 1-out-of-2, 1-out-of-n and k-out-of-n oblivious transfer. Oblivious transfer is a counter-intuitive cryptographic primitive in which the receiver receives only the information he is authorized for, while the sender does not know what information receiver received. In 1-out-of-2 oblivious transfer, Alice sends two bits to Bob who can choose only one of them to read, while Alice does not know which bit Bob read. k-out-of-n oblivious transfer is an extension of this idea. The proposed protocols do not require any classical communication, are practical, secure and can be implemented using current technology.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 1, 2013•2 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•5 citations

Noninteractive xor Quantum Oblivious Transfer: Optimal Protocols and Their Experimental Implementations

Lara Stroh, Nikola Horová, Robert Stárek +4 more

Oblivious transfer (OT) is an important cryptographic primitive.Any multiparty computation can be realized with OT as building block.XOR oblivious transfer (XOT) is a variant where the sender Alice has two bits and a receiver Bob obtains either the first bit, the second bit, or their XOR.Bob should not learn anything more than this and Alice should not learn what Bob has learnt.Perfect quantum OT with information-theoretic security is known to be impossible.We determine the smallest possible cheating probabilities for unrestricted dishonest parties in noninteractive quantum XOT protocols using symmetric pure states and present an optimal protocol, which outperforms classical protocols.We also "reverse" this protocol, so that Bob becomes sender of a quantum state and Alice the receiver who measures it, while still implementing oblivious transfer from Alice to Bob.Cheating probabilities for both parties stay the same as for the unreversed protocol.We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.

arXiv:2209.11300•PRX Quantum•May 4, 2023•16 citations

Oblivious transfer and quantum non-locality

Stefan Wolf, Jürg Wullschleger

Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the receiver's choice. Oblivious transfer the security of which is information-theoretic for both parties is known impossible to achieve from scratch. The joint behavior of certain bi-partite quantum states is non-local, i.e., cannot be explained by shared classical information. In order to better understand such behavior, which is classically explainable only by communication, but does not allow for it, Popescu and Rohrlich have described a "non-locality machine": Two parties both input a bit, and both get a random output bit the XOR of which is the AND of the input bits. We show a close connection, in a cryptographic sense, between OT and the "PR primitive." More specifically, unconditional OT can be achieved from a single realization of PR, and vice versa. Our reductions, which are single-copy, information-theoretic, and perfect, also lead to a simple and optimal protocol allowing for inverting the direction of OT

arXiv:quant-ph/0502030•IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•32 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

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
Abstract- Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any information about the other bit. Alice on the other hand does not obtain any information about Bob’s choice. We present a new technique for the same task in quantum environment, based on POVM measurements. It is shown that our method has two important advantages over the previous approaches. First, it is unconditionally secure without invoking a commitment scheme, and second, it is more efficient in terms of communication complexity. Key words: Oblivious transfer, POVM measurements, Unconditional security
We propose a quantum protocol for 1-out-of-2, 1-out-of-n and k-out-of-n oblivious transfer. Oblivious transfer is a counter-intuitive cryptographic primitive in which the receiver receives only the information he is authorized for, while the sender does not know what information receiver received. In 1-out-of-2 oblivious transfer, Alice sends two bits to Bob who can choose only one of them to read, while Alice does not know which bit Bob read. k-out-of-n oblivious transfer is an extension of this idea. The proposed protocols do not require any classical communication, are practical, secure and can be implemented using current technology.
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 an important cryptographic primitive.Any multiparty computation can be realized with OT as building block.XOR oblivious transfer (XOT) is a variant where the sender Alice has two bits and a receiver Bob obtains either the first bit, the second bit, or their XOR.Bob should not learn anything more than this and Alice should not learn what Bob has learnt.Perfect quantum OT with information-theoretic security is known to be impossible.We determine the smallest possible cheating probabilities for unrestricted dishonest parties in noninteractive quantum XOT protocols using symmetric pure states and present an optimal protocol, which outperforms classical protocols.We also "reverse" this protocol, so that Bob becomes sender of a quantum state and Alice the receiver who measures it, while still implementing oblivious transfer from Alice to Bob.Cheating probabilities for both parties stay the same as for the unreversed protocol.We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.
Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the receiver's choice. Oblivious transfer the security of which is information-theoretic for both parties is known impossible to achieve from scratch. The joint behavior of certain bi-partite quantum states is non-local, i.e., cannot be explained by shared classical information. In order to better understand such behavior, which is classically explainable only by communication, but does not allow for it, Popescu and Rohrlich have described a "non-locality machine": Two parties both input a bit, and both get a random output bit the XOR of which is the AND of the input bits. We show a close connection, in a cryptographic sense, between OT and the "PR primitive." More specifically, unconditional OT can be achieved from a single realization of PR, and vice versa. Our reductions, which are single-copy, information-theoretic, and perfect, also lead to a simple and optimal protocol allowing for inverting the direction of OT
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 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.