Optimal bounds for semi-honest quantum oblivious transfer
arXiv:1310.3262
Abstract
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum oblivious transfer protocols under a natural and demanding definition of what it means for Alice to cheat. Our lower bound is a smooth tradeoff between the probability B with which Bob can guess Alice's bit choice and the probability A with which Alice can guess both of Bob's bits given that she learns one of the bits with certainty. We prove that 2B + A is greater than or equal to 2 in any quantum protocol for oblivious transfer, from which it follows that one of the two parties must be able to cheat with probability at least 2/3. We prove that this bound is optimal by exhibiting a family of protocols whose cheating probabilities can be made arbitrarily close to any point on the tradeoff curve.
arXiv commentAccepted version. 16 pages, new title, results unchanged
References in corpus (16)
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Insecurity of Quantum Secure Computations
- Cryptography from Noisy Storage
- Optimal lower bounds for quantum automata and random access codes
- Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
- The Impossibility Of Secure Two-Party Classical Computation
- An Experimental Implementation of Oblivious Transfer in the Noisy Storage Model
- Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model
- Cryptographic Distinguishability Measures for Quantum Mechanical States
- A theorem about relative entropy of quantum states with an application to privacy in quantum communication
- Optimal bounds for quantum bit commitment
- Cryptography in the Bounded-Quantum-Storage Model
- Optimal quantum strong coin flipping
- On the Power of Two-Party Quantum Cryptography
- A simpler proof of existence of quantum weak coin flipping with arbitrarily small bias