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

arXiv:quant-ph/9512026

A simple quantum oblivious transfer protocol

M. Ardehali

Published Dec 26, 1995• 4 citations
arXivHTMLPDF

Abstract

A simple and efficient protocol for quantum oblivious transfer is proposed. The protocol can easily be implemented with present technology and is secure against cheaters with unlimited computing power provided the receiver does not have the technology to store the particles for an arbitrarily long period of time. The proposed protocol is a significant improvement over the previous protocols. Unlike the protocol of Crépeau and Kilian which is secure if only if the spin of the particle is measured along the $x$ or the $y$ axis, the present protocol is perfectly secure no matter along which axes the spin of the particles are measured, and unlike the protocol of Bennett et al. which requires tens of thousand of particles, the present protocol requires only two particles.

DOI
10.48550/arxiv.quant-ph/9512026

Related papers

Quantum oblivious transfer protocols based on EPR states

M. Ardehali

We describe efficient protocols for quantum oblivious transfer and for one-out-of-two quantum oblivious transfer. These protocols, which can be implemented with present technology, are secure against general attacks as long as the cheater can not store the bit for an arbitrarily long period of time.

arXiv:quant-ph/9505015•May 24, 1995•0 citations

A Quantum Bit Commitment Protocol Based on EPR States

M. Ardehali

A protocol for quantum bit commitment is proposed. The protocol is feasible with present technology and is secure against cheaters with unlimited computing power as long as the sender does not have the technology to store an EPR particle for an arbitrarily long period of time. The protocol is very efficient, requiring only tens of particles.

arXiv:quant-ph/9505019•May 26, 1995•5 citations

Defeating classical bit commitments with a quantum computer

Gilles Brassard A, Claude Crépeau, Dominic Mayers +1 more

It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to perform a measurement. Similar situations had been encountered previously in the design of Quantum Oblivious Transfer. The question is whether a classical bit commitment could be used for this specific purpose. We demonstrate that, surprisingly, classical unconditionally concealing bit commitments do not help.

arXiv:quant-ph/9806031•Jun 9, 1998•20 citations

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

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

Obliq: a Novel Protocol for Oblivious Transfer

M. K. Srivastava, Sunil Kumar Singh, Pradeep Kumar Singh

Oblivious transfer is a type of message transfer in which a sender transmits one out of many potential pieces of information to the receiver, but she has no knowledge about the actual piece of information being received by the receiver. Oblivious transfer is a deceptively simple scheme that has many possible applications such as secure multiparty computation, private set intersection, federated learning, zero-knowledge proofs, accessing sensitive data etc. Security of most classical oblivious transfer protocols is based upon the unproven assumptions about the computational complexity of certain number theoretic problems such as integer factorization. So, existing classical protocols for oblivious transfer are only computationally secure and not unconditionally secure. Although many quantum oblivious protocols have been proposed lately, they are not simple and easy to implement. In the present work we propose a quantum oblivious transfer protocol that is efficient, simple and easily implementable with the existing quantum technology.

Proceedings of NAS RA Physics•Nov 5, 2025•0 citations
A simple and efficient protocol for quantum oblivious transfer is proposed. The protocol can easily be implemented with present technology and is secure against cheaters with unlimited computing power provided the receiver does not have the technology to store the particles for an arbitrarily long period of time. The proposed protocol is a significant improvement over the previous protocols. Unlike the protocol of Crépeau and Kilian which is secure if only if the spin of the particle is measured along the xxx or the yyy axis, the present protocol is perfectly secure no matter along which axes the spin of the particles are measured, and unlike the protocol of Bennett et al. which requires tens of thousand of particles, the present protocol requires only two particles.
It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to perform a measurement. Similar situations had been encountered previously in the design of Quantum Oblivious Transfer. The question is whether a classical bit commitment could be used for this specific purpose. We demonstrate that, surprisingly, classical unconditionally concealing bit commitments do not help.
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.
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 is a type of message transfer in which a sender transmits one out of many potential pieces of information to the receiver, but she has no knowledge about the actual piece of information being received by the receiver. Oblivious transfer is a deceptively simple scheme that has many possible applications such as secure multiparty computation, private set intersection, federated learning, zero-knowledge proofs, accessing sensitive data etc. Security of most classical oblivious transfer protocols is based upon the unproven assumptions about the computational complexity of certain number theoretic problems such as integer factorization. So, existing classical protocols for oblivious transfer are only computationally secure and not unconditionally secure. Although many quantum oblivious protocols have been proposed lately, they are not simple and easy to implement. In the present work we propose a quantum oblivious transfer protocol that is efficient, simple and easily implementable with the existing quantum technology.