Arbitrarily long relativistic bit commitment
arXiv:1507.00239 · doi:10.1103/PhysRevLett.115.250501
Abstract
We consider the recent relativistic bit commitment protocol introduced by Lunghi et al. [Phys. Rev. Lett. 2015] and present a new security analysis against classical attacks. In particular, while the initial complexity of the protocol scaled 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 only requiring both parties to communicate classically and perform efficient classical computation.
arXiv commentIn an independent and concurrent work, Fehr and Fillinger [FF15] proved a general composition theorem for two-prover commitments which implies a similar bound on the security of the Lunghi et al. protocol than the one derived here
References in corpus (14)
- The Security of Practical Quantum Key Distribution
- Bell nonlocality
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Unconditionally Secure Bit Commitment
- Cryptography from Noisy Storage
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- Experimental bit commitment based on quantum communication and special relativity
- Unconditionally Secure Bit Commitment with Flying Qudits
- Experimental unconditionally secure bit commitment
- Causality and Cirel'son bounds
- Practical relativistic bit commitment
- Secure bit commitment from relativistic constraints
- Security Details for Bit Commitment by Transmitting Measurement Outcomes
Cited by in corpus (10)
- Secure quantum key distribution with realistic devices
- 24-Hour Relativistic Bit Commitment
- Spacetime-constrained oblivious transfer
- Multiphoton and side-channel attacks in mistrustful quantum cryptography
- Composable security in relativistic quantum cryptography
- Quantum cryptography beyond key distribution: theory and experiment
- Relativistic (or -prover -round) zero-knowledge protocol for secure against quantum adversaries
- Unconditionally secure relativistic multi-party biased coin flipping and die rolling
- Tight bound on the classical value of generalized Clauser-Horne-Shimony-Holt games
- Robust Relativistic Bit Commitment