Lower bounds for Quantum Oblivious Transfer

DOI10.4230/LIPIcs.FSTTCS.2010.157zbMath1245.94070arXiv1007.1875OpenAlexW2116141717MaRDI QIDQ2908846

André Chailloux, Jamie Sikora, Iordanis Kerenidis

Publication date: 29 August 2012

Full work available at URL: https://arxiv.org/abs/1007.1875

zbMATH Keywords

semidefinite programmingquantum oblivious transfercoin flipping protocol

Mathematics Subject Classification ID

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

Related Items (5)

Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment ⋮ A new framework for quantum oblivious transfer ⋮ Coherent attack on oblivious transfer based on single-qubit rotations ⋮ Unnamed Item ⋮ Secure quantum weak oblivious transfer against individual measurements

This page was built for publication: Lower bounds for Quantum Oblivious Transfer