A quantum oblivious transfer protocol

Author(s):  
Abhishek Parakh
2013 ◽  
Vol 13 (1&2) ◽  
pp. 158-177
Author(s):  
Andre 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 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.


2012 ◽  
Vol 12 (7&8) ◽  
pp. 609-619
Author(s):  
Jamie Sikora

Oblivious transfer is the cryptographic primitive where Alice sends one of two bits to Bob but is oblivious to the bit received. Using quantum communication, we can build oblivious transfer protocols with security provably better than any protocol built using classical communication. However, with imperfect apparatus, one needs to consider other attacks. In this paper, we present an oblivious transfer protocol which is impervious to lost messages.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 164667-164681
Author(s):  
Hao Long ◽  
Shukui Zhang ◽  
Yang Zhang ◽  
Li Zhang ◽  
Jin Wang

Author(s):  
Xiaochao Wei ◽  
Chuan Zhao ◽  
Han Jiang ◽  
Qiuliang Xu ◽  
Hao Wang

1994 ◽  
Vol 41 (12) ◽  
pp. 2445-2454 ◽  
Author(s):  
Claude Crépeau

Sign in / Sign up

Export Citation Format

Share Document