Lower bounds for Quantum Oblivious Transfer

André Chailloux, Iordanis Kerenidis & Jamie Sikora
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 her probability of guessing...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.