24-Hour Relativistic Bit Commitment.

Bit commitment is a fundamental cryptographic primitive in which a party wishes to commit a secret bit to another party. Perfect security between mistrustful parties is unfortunately impossible to achieve through the asynchronous exchange of classical and quantum messages. Perfect security can nonetheless be achieved if each party splits into two agents exchanging classical information at times and locations satisfying strict relativistic constraints. A relativistic multiround protocol to achieve this was previously proposed and used to implement a 2-millisecond commitment time. Much longer durations were initially thought to be insecure, but recent theoretical progress showed that this is not so. In this Letter, we report on the implementation of a 24-hour bit commitment solely based on timed high-speed optical communication and fast data processing, with all agents located within the city of Geneva. This duration is more than 6 orders of magnitude longer than before, and we argue that it could be extended to one year and allow much more flexibility on the locations of the agents. Our implementation offers a practical and viable solution for use in applications such as digital signatures, secure voting and honesty-preserving auctions.

[1]  Matej Pivoluska,et al.  Tight bound on the classical value of generalized Clauser-Horne-Shimony-Holt games , 2016, 1601.08095.

[2]  T Lunghi,et al.  Practical Relativistic Bit Commitment. , 2014, Physical review letters.

[3]  Kaushik Chakraborty,et al.  Arbitrarily long relativistic bit commitment , 2015, Physical review letters.

[4]  Dominic Mayers Unconditionally secure quantum bit commitment is impossible , 1997 .

[5]  Hoi-Kwong Lo,et al.  Is Quantum Bit Commitment Really Possible? , 1996, ArXiv.

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

[7]  S. Diddams,et al.  Standards of Time and Frequency at the Outset of the 21st Century , 2004, Science.

[8]  Ivan Damgård,et al.  A Tight High-Order Entropic Quantum Uncertainty Relation with Applications , 2006, CRYPTO.

[9]  I. Damgård,et al.  Cryptography in the Bounded Quantum Storage Model , 2005 .

[10]  Nicolas Gisin,et al.  Quantum Random Number Generation on a Mobile Phone , 2014, 1405.0435.

[11]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[12]  S. Wehner,et al.  Experimental bit commitment based on quantum communication and special relativity. , 2013, Physical review letters.

[13]  Mihir Bellare Advances in cryptology - CRYPTO 2000 : 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000 : proceedings , 2000, CRYPTO 2000.

[14]  A. J. Menezes,et al.  Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings , 2007, CRYPTO.

[15]  Alain Tapp,et al.  Information-Theoretically Secure Voting Without an Honest Majority , 2008, IACR Cryptol. ePrint Arch..

[16]  Jean-Sébastien Coron,et al.  Advances in Cryptology EUROCRYPT 2016 : 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part I , 2016 .

[17]  R. Werner,et al.  Reexamination of quantum bit commitment: The possible and the impossible , 2006, quant-ph/0605224.

[18]  Yong Zhao,et al.  Experimental unconditionally secure bit commitment. , 2013, Physical review letters.

[19]  Ivan Damgård,et al.  Lectures on Data Security , 2003, Lecture Notes in Computer Science.

[20]  Adrian Kent,et al.  Unconditionally Secure Bit Commitment , 1998, quant-ph/9810068.

[21]  Ivan Damgård,et al.  Commitment Schemes and Zero-Knowledge Protocols , 1998, Lectures on Data Security.

[22]  Adrian Kent,et al.  Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes , 2011, Physical review letters.