Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01407421
Contributor : Anthony Leverrier <>
Submitted on : Friday, December 2, 2016 - 10:17:26 AM
Last modification on : Wednesday, December 25, 2019 - 1:10:26 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 8:30:21 AM

File

1608.03398v1.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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

Share

Metrics

Record views

205

Files downloads

230