Arbitrarily long relativistic bit commitment

@article{Chakraborty2015ArbitrarilyLR,
  title={Arbitrarily long relativistic bit commitment},
  author={Kaushik Chakraborty and Andr{\'e} Chailloux and Anthony Leverrier},
  journal={Physical review letters},
  year={2015},
  volume={115 25},
  pages={
          250501
        }
}
We consider the recent relativistic bit commitment protocol introduced by Lunghi et al. [Phys. Rev. Lett. 115, 030502 (2015)] and present a new security analysis against classical attacks. In particular, while the initial complexity of the protocol scales double exponentially with the commitment time, our analysis shows that the correct dependence is only linear. This has dramatic implications in terms of implementation: in particular, the commitment time can easily be made arbitrarily long, by… 
Robust Relativistic Bit Commitment
TLDR
A robust protocol for relativistic bit commitment that tolerates failures of the classical communication network is introduced by adding a third agent to both parties, providing a quadratic improvement in terms of expected sustain time compared to the original protocol, while retaining the same level of security.
24-Hour Relativistic Bit Commitment.
TLDR
This Letter reports 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, and argues that it could be extended to one year and allow much more flexibility on the locations of the agents.
Relativistic (or 2-prover 1-round) zero-knowledge protocol for NP secure against quantum adversaries
TLDR
This paper shows that the zero-knowledge construction for Hamiltonian Cycle remains secure against quantum adversaries in the relativistic setting, and proves security bounds for the (single-round) relatvistic string commitment and bit commitment in parallel against Quantum adversaries.
Composable security in relativistic quantum cryptography
TLDR
It is shown that coin flipping can be constructed from the primitive channel with delay, biased coin flipping, bit commitment and channel with Delay are all impossible without further assumptions, and it is impossible to improve a channel withdelay.
Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for \mathsf NP Secure Against Quantum Adversaries
TLDR
This paper shows that the zero-knowledge construction for Hamiltonian Cycle remains secure against quantum adversaries in the relativistic setting, and proves security bounds for the (single-round) relatIVistic string commitment and bit commitment in parallel against Quantum adversaries.
Relativistic verifiable delegation of quantum computation
TLDR
This work presents the first verifiable delegation scheme where a classical client delegates her quantum computation to two entangled servers that are allowed to communicate, but respecting the plausible assumption that information cannot be propagated faster than speed of light.
A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round
TLDR
The parameters of the protocol make it possible to prove security even if the servers are allowed to communicate, but respecting the plausible assumption that information cannot be propagated faster than speed of light, making it the first relativistic protocol for quantum computation.
Cryptography with spacetime constraints
TLDR
This thesis has studied how to exploit relativistic constraints such as the non-superluminal signalling principle to design secure cryptographic primitives like position-verification and bit commitment, and established an upper bound on the classical value of such family of games.
Recursive Cheating Strategies for the Relativistic FQ Bit Commitment Protocol
TLDR
Cheating strategy for the $F_Q$ multi-round bit commitment scheme shows that if $Q$ is an even power of any prime, then the protocol is not secure when the number of rounds $m$ is of the order of $\sqrt{Q}$.
...
...

References

SHOWING 1-10 OF 34 REFERENCES
Advances in Cryptology — CRYPTO ’96
  • N. Koblitz
  • Computer Science, Mathematics
    Lecture Notes in Computer Science
  • 2001
TLDR
This work presents new, simple, and practical constructions of message authentication schemes based on a cryptographic hash function, and proves that NMAC and HMAC are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths.
Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings
TLDR
The next generation of Secure and Practical RSA-Based Signatures and Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution are presented.
Information Theory
Information TheoryPapers read at a Symposium on Information Theory held at the Royal Institution, London, August 29th to September 2nd, 1960. Edited by Colin Cherry. Pp. xi + 476. (London:
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science
The papers in this volume were presented at the 6th Innovations in Theoretical Computer Science (ITCS 2015) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation
Proceedings of IEEE Professional Communication Society International Professional Communication Conference and Proceedings of the 18th Annual ACM International Conference on Computer Documentation: Technology & Teamwork, Cambridge, Massachusetts, USA, September 24-27, 2000
TLDR
For four days, technical communicators, researchers, educators and usability professionals come together in these pages to discuss principles and practices of working in teams with new tools to make sure the products the authors support are the ones their customers can use.
MASTER’S THESIS
TLDR
The author of this thesis aimed at investigating the positive and negative effects of using social media through collecting the users' experiences and professionals' viewpoints, and identified other practical effects and aspects of social media.
Phys
  • Rev. Lett. 83, 1447
  • 1999
and H
  • Zbinden, arXiv preprint arXiv:1411.4917
  • 2014
Phys
  • Rev. A 72, 052103
  • 2005
Information Theory
...
...