The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Lower Bounds for Quantum Oblivious Transfer
[article]
2013
arXiv
pre-print
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest players' cheating. Finding the optimal security parameters in such protocols is an important open question. In this paper we show that every 1-out-of-2 oblivious transfer protocol allows a dishonest party to cheat with probability bounded below by a constant strictly larger than 1/2. Alice's cheating is defined as
arXiv:1007.1875v2
fatcat:jdvcmfyahbfcnlkm5m35qta7si