Lower Bounds for Quantum Oblivious Transfer

Details Lower Bounds for Quantum Oblivious Transfer Lower Bounds for Quantum Oblivious Transfer

2010-07-12

arxiv.org/abs/1007.1875v1

Physics

Quantum Physics

v1, 23p

Scientific paper

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 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 coin flipping protocol and conclude by using Kitaev's coin flipping lower bound. 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.

Affiliated with

Also associated with

No associations

Rating

Lower Bounds for Quantum Oblivious Transfer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower Bounds for Quantum Oblivious Transfer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds for Quantum Oblivious Transfer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696230