A device-independent protocol for XOR oblivious transfer

Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. Ideally, Alice should not learn Bob's desired function choice and Bob should not learn any more than what is logically implied by the function value. While decent quantum protocols for this task are known, many become completely insecure if an adversary were to control the quantum devices used in the implementation of the protocol. In this work we give a fully device-independent quantum protocol for XOR oblivious transfer which is provably more secure than any classical protocol.

[1]  Joe Kilian,et al.  Founding crytpography on oblivious transfer , 1988, STOC '88.

[2]  Hoi-Kwong Lo,et al.  Insecurity of Quantum Secure Computations , 1996, ArXiv.

[3]  Andrew Chi-Chih Yao,et al.  Quantum cryptography with imperfect apparatus , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[4]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[5]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

[6]  Ivan Damgård,et al.  Cryptography in the bounded quantum-storage model , 2005, IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005..

[7]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[8]  Gus Gutoski,et al.  Toward a general theory of quantum games , 2006, STOC '07.

[9]  Christian Schaffner,et al.  Cryptography from noisy storage. , 2007, Physical review letters.

[10]  A. Acín,et al.  A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations , 2008, 0803.4290.

[11]  Jürg Wullschleger,et al.  Composable Security in the Bounded-Quantum-Storage Model , 2007, ICALP.

[12]  John Watrous,et al.  Semidefinite Programs for Completely Bounded Norms , 2009, Theory Comput..

[13]  V. Scarani,et al.  Device-independent quantum key distribution secure against collective attacks , 2009, 0903.4460.

[14]  Iordanis Kerenidis,et al.  Lower bounds for quantum oblivious transfer , 2010, Quantum Inf. Comput..

[15]  Stefano Pironio,et al.  Weak Coin Flipping in a Device-Independent Setting , 2011, TQC.

[16]  N Aharon,et al.  Fully distrustful quantum bit commitment and coin flipping. , 2011, Physical review letters.

[17]  T. H. Yang,et al.  Robust self-testing of the singlet , 2012, 1203.2976.

[18]  T. Moroder,et al.  Bounding temporal quantum correlations. , 2013, Physical review letters.

[19]  Iordanis Kerenidis,et al.  Strong connections between quantum encodings, non-locality and quantum cryptography , 2013, 1304.0983.

[20]  Stefano Pironio,et al.  Device-independent bit commitment based on the CHSH inequality , 2015, 1511.06283.

[21]  Matthew McKague,et al.  Self-testing in parallel with CHSH , 2016, 1609.09584.

[22]  Jean-Daniel Bancal,et al.  Device-independent parallel self-testing of two singlets , 2015, 1512.02074.

[23]  Rudolf Ahlswede,et al.  Founding Cryptography on Oblivious Transfer , 2016 .

[24]  Gus Gutoski,et al.  Optimal bounds for semi-honest quantum oblivious transfer , 2013, Chic. J. Theor. Comput. Sci..

[25]  Matthew Coudron,et al.  The Parallel-Repeated Magic Square Game is Rigid , 2016, 1609.06306.

[26]  Thomas Vidick,et al.  Practical device-independent quantum cryptography via entropy accumulation , 2018, Nature Communications.

[27]  Carl A Miller,et al.  Local Randomness: Examples and Application. , 2017, Physical review. A.

[28]  Lídia del Rio,et al.  Composable security in relativistic quantum cryptography , 2017, New Journal of Physics.