Statistically Secure Quantum Oblivious Transfer

Abstract. In 1997, Lo claimed that Quantum Oblivious Transfer (QOT) is impossible. The result implies severe setback for quantum cryptography. However, it is based on a hypothesis. i.e. to prevent Alice from learning Bob’s choice in the scheme, the reduced density matrices in Alice’s hand for the two cases must be the same. Actually, to prevent Alice from learning his choice, Bob can send the qubits built in different bases, Base0 and Base1, one would let him to get b0, the other one would let him to get b1. In this paper, we construct a Statistically-Secure Quantum 1-out-of-2 Oblivious Transfer, which bypasses the attack of Lo.