Quantum Rabin oblivious transfer using two pure states

TL;DR

This paper introduces a quantum Rabin oblivious transfer protocol utilizing two pure states, analyzes its security against cheating, and demonstrates its advantages over classical and mixed-state quantum protocols for certain parameters.

Contribution

It presents a novel quantum Rabin OT protocol with two pure states and evaluates its security and performance, showing advantages over classical and mixed-state quantum protocols.

Findings

Quantum protocol outperforms classical Rabin OT for some probabilities.

Pure states can be more effective than mixed states in certain scenarios.

Optimal cheating probabilities are determined for both sender and receiver.

Abstract

Oblivious transfer between two untrusting parties is an important primitive in cryptography. There are different variants of oblivious transfer. In Rabin oblivious transfer, the sender Alice holds a bit, and the receiver Bob either obtains the bit, or obtains no information with probability $p_?$. Alice should not know whether or not Bob obtained the bit. We examine a quantum Rabin oblivious transfer (OT) protocol that uses two pure states. Investigating different cheating scenarios for the sender and for the receiver, we determine optimal cheating probabilities in each case. Comparing the quantum Rabin oblivious transfer protocol to classical Rabin oblivious transfer protocols, we show that the quantum protocol outperforms classical protocols, which do not use a third party, for some values of $p_?$. We find that quantum Rabin OT protocols that use mixed states can outperform quantum Rabin OT protocols that use pure states for some values of $p_?$.