Robust Relativistic Bit Commitment

Abstract : Relativistic cryptography exploits the fact that no information can travel faster than the speed of light in order to obtain security guarantees that cannot be achieved from the laws of quantum mechanics alone. Recently, Lunghi et al [Phys. Rev. Lett. 2015] presented a bit commitment scheme where each party uses two agents that exchange classical information in a synchronized fashion, and that is both hiding and binding. A caveat is that the commitment time is intrinsically limited by the spatial configuration of the players, and increasing this time requires the agents to exchange messages during the whole duration of the protocol. While such a solution remains computationally attractive, its practicality is severely limited in realistic settings since all communication must remain perfectly synchronized at all times. In this work, we introduce a robust protocol for relativistic bit commitment that tolerates failures of the classical communication network. This is done by adding a third agent to both parties. Our scheme provides a quadratic improvement in terms of expected sustain time compared to the original protocol, while retaining the same level of security.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger
Contributeur : Anthony Leverrier <>
Soumis le : vendredi 2 décembre 2016 - 10:17:26
Dernière modification le : jeudi 26 avril 2018 - 10:28:42
Document(s) archivé(s) le : mardi 21 mars 2017 - 08:30:21


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01407421, version 1
  • ARXIV : 1608.03398



Kaushik Chakraborty, André Chailloux, Anthony Leverrier. Robust Relativistic Bit Commitment. 2016. 〈hal-01407421〉



Consultations de la notice


Téléchargements de fichiers