Practical relativistic bit commitment

Abstract

Bit commitment is a fundamental cryptographic primitive in which Alice wishes to commit a secret bit to Bob. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information. Perfect security is however possible when Alice and Bob each split into several agents exchanging classical information at times and locations suitably chosen to satisfy specific relativistic constraints. In this Letter we first revisit a previously proposed scheme that realizes bit commitment using only classical communication. We prove that the protocol is secure against quantum adversaries for a duration limited by the light-speed communication time between the locations of the agents. We then propose a novel multi-round scheme based on finite-field arithmetic that extends the commitment time beyond this limit, and we prove its security against classical attacks. Finally, we present an implementation of these protocols using dedicated hardware and we show how it could be used to realize commitments of duration ranging up to 212 milliseconds by agents occupying antipodal locations on the Earth.

5 pages, 1 figure (excluding Supplemental Material), revtex, published version

References in corpus (5)

• Cryptography from Noisy Storage
• Experimental bit commitment based on quantum communication and special relativity
• Experimental unconditionally secure bit commitment
• Security Details for Bit Commitment by Transmitting Measurement Outcomes
• Strong connections between quantum encodings, non-locality and quantum cryptography

Cited by in corpus (28)

• Secure quantum key distribution with realistic devices
• Practical challenges in quantum key distribution
• Quantum Cryptography Beyond Quantum Key Distribution
• A Simple Voting Protocol on Quantum Blockchain
• Quantum cryptography: key distribution and beyond
• Causal Boxes: Quantum Information-Processing Systems Closed under Composition
• 24-Hour Relativistic Bit Commitment
• Spacetime-constrained oblivious transfer
• Arbitrarily long relativistic bit commitment
• Multiphoton and side-channel attacks in mistrustful quantum cryptography
• Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation
• Composable security in relativistic quantum cryptography
• One-out-of-$m$ spacetime-constrained oblivious transfer
• Generalized XOR games with $d$ outcomes and the task of non-local computation
• Quantum cryptography beyond key distribution: theory and experiment
• Experimental relativistic zero-knowledge proofs
• Quantum bounds on multiplayer linear games and device-independent witness of genuine tripartite entanglement
• Practical quantum tokens without quantum memories and experimental tests
• Relativistic (or $2$-prover $1$-round) zero-knowledge protocol for $\mathsf{NP}$ secure against quantum adversaries
• Quantum bit commitment and the reality of the quantum state
• Delayed choice relativistic quantum bit commitment with arbitrarily long commitment time
• Unconditionally secure relativistic multi-party biased coin flipping and die rolling
• Tight bound on the classical value of generalized Clauser-Horne-Shimony-Holt games
• Bit Commitment for Lottery and Auction on Quantum Blockchain
• A decompositional framework for process theories in spacetime
• Cryptanalysis and improvement of Wu-Cai-Wu-Zhang's quantum private comparison protocol
• Non-Locality and Zero-Knowledge MIPs
• Robust Relativistic Bit Commitment