Security of quantum protocols against coherent measurements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A new protocol and lower bounds for quantum coin flipping
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Weak coin flipping with small bias
Information Processing Letters
Multiparty Quantum Coin Flipping
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Cryptography in the Bounded-Quantum-Storage Model
SIAM Journal on Computing
On the Power of Two-Party Quantum Cryptography
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Optimal Quantum Strong Coin Flipping
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Sampling in a quantum population, and applications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Oblivious transfer and linear functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Hi-index | 0.00 |
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest player's 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 Bob's index, and Bob's cheating is defined as his probability of guessing both input bits of Alice. In our proof, we relate these cheating probabilities to the cheating probabilities of a bit commitment protocol and conclude by using lower bounds on quantum bit commitment. Then, we present an oblivious transfer protocol with two messages and cheating probabilities at most 3/4. Last, we extend Kitaev's semidefinite programming formulation to more general primitives, where the security is against a dishonest player trying to force the outcome of the other player, and prove optimal lower and upper bounds for them.