Lower bounds for quantum oblivious transfer

DOI10.4230/LIPICS.FSTTCS.2010.157MaRDI QIDQ2908846zbMATH OpenOpenAlexFDO

Authors André Chailloux, Iordanis Kerenidis, Jamie Sikora

Publication date 29 August 2012

Full work available at URL https://arxiv.org/abs/1007.1875, http://subs.emis.de/LIPIcs/frontdoor_7ff5.html

zbMATH Keywords

semidefinite programmingquantum oblivious transfercoin flipping protocol

Mathematics Subject Classification ID

Cryptography (94A60) Semidefinite programming (90C22) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68)

Abstract: 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.

Recommendations

• Optimal bounds for semi-honest quantum oblivious transfer
• Lower Bounds for Oblivious Transfer Reductions
• Quantum Oblivious Transfer
• Quantum oblivious transfer with relaxed constraints on the receiver
• Quantum m-out-of-n oblivious transfer
• Bounds on oblivious multiparty quantum communication complexity
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• Quantum oblivious transfer: a secure practical implementation
• Lower Bounds for Quantum Communication Complexity
• Secure quantum weak oblivious transfer against individual measurements

Cited in

(13)

• Oblivious transfer and quantum channels as communication resources
• Secure quantum weak oblivious transfer against individual measurements
• scientific article; zbMATH DE number 7651039 (Why is no real title available?)
• Coherent attack on oblivious transfer based on single-qubit rotations
• Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
• A new framework for quantum oblivious transfer
• Fidelity of quantum strategies with applications to cryptography
• Quantifying the leakage of quantum protocols for classical two-party cryptography
• Quantum oblivious transfer with relaxed constraints on the receiver
• Lower Bounds for Oblivious Transfer Reductions
• Optimal bounds for semi-honest quantum oblivious transfer
• Quantifying the leakage of quantum protocols for classical two-party cryptography
• On the power of two-party quantum cryptography

This page was built for publication: Lower bounds for quantum oblivious transfer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908846)