[Paper Review] A simple quantum oblivious transfer protocol

M. Ardehali|ArXiv.org|Dec 26, 1995

Quantum Information and Cryptography3 citations

TL;DR

This paper proposes a simple, efficient quantum oblivious transfer protocol using only two entangled particles, where Alice sends two particles with spin oriented along horizontal or vertical axes. The protocol is perfectly secure against any cheating adversary with unlimited computational power, provided the receiver cannot store particles indefinitely, and improves upon prior work by eliminating reliance on specific measurement bases and reducing resource requirements from tens of thousands to just two particles.

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.

Motivation & Objective

• To design a quantum oblivious transfer protocol that is both simple and efficient, minimizing resource requirements.
• To achieve perfect security regardless of the measurement basis used by the receiver.
• To eliminate the need for large numbers of particles, unlike previous protocols requiring tens of thousands.
• To ensure security under the constraint that the receiver cannot store quantum particles for arbitrarily long times.
• To improve clarity and robustness of security proofs compared to earlier protocols.

Proposed method

• The protocol uses two entangled particles prepared in a Bell state, with spins oriented along horizontal or vertical axes.
• Alice prepares and sends two particles to Bob, encoding classical bits in the spin states along predefined axes.
• Bob measures the spin of each particle along a randomly chosen basis, which determines his outcome.
• The protocol structure mirrors earlier OT schemes but is simplified to use only two particles instead of many.
• Security is proven under the assumption that the receiver cannot store particles for long durations, preventing delayed measurement attacks.
• The security analysis is strengthened by clarifying the conditions under which cheating is impossible, regardless of measurement basis.

Experimental results

Research questions

• RQ1 Can a quantum oblivious transfer protocol be constructed using only two entangled particles while maintaining strong security?
• RQ2 Is it possible to achieve perfect security regardless of the measurement basis chosen by the receiver?
• RQ3 How can the resource efficiency of quantum OT be improved compared to protocols requiring thousands of particles?
• RQ4 What are the minimal physical assumptions needed to ensure security against unbounded adversaries?
• RQ5 Can the security proof be made clearer and more robust without increasing complexity?

Key findings

• The protocol requires only two entangled particles, representing a significant reduction in resource overhead compared to prior protocols.
• Security is maintained regardless of the measurement basis used by the receiver, unlike earlier protocols that required specific measurement directions.
• The protocol is secure against any cheating adversary with unlimited computational power, provided the receiver cannot store particles indefinitely.
• The security proof has been clarified and strengthened in the revised version, enhancing confidence in the protocol's robustness.
• The protocol is implementable with current technology, making it practical for near-term quantum communication systems.
• The protocol achieves perfect security in the sense that the receiver cannot learn more than one of Alice’s bits, and Alice cannot learn which bit the receiver obtained.