Secure bit commitment from relativistic constraints
Authors:
- Jędrzej KaniewskiJKJędrzej Kaniewski
- Marco TomamichelMTMarco Tomamichel
- Esther HänggiEHEsther Hänggi
- Stephanie WehnerSWStephanie Wehner
Preprint
Abstract
We investigate two-party cryptographic protocols that are secure under assumptions motivated by physics, namely relativistic assumptions (no-signalling) and quantum mechanics. In particular, we discuss the security of bit commitment in so-called split models, i.e. models in which at least some of the parties are not allowed to communicate during certain phases of the protocol. We find the minimal splits that are necessary to evade the Mayers-Lo-Chau no-go argument and present protocols that achieve security in these split models. Furthermore, we introduce the notion of local versus global command, a subtle issue that arises when the split committer is required to delegate non-communicating agents to open the commitment. We argue that classical protocols are insecure under global command in the split model we consider. On the other hand, we provide a rigorous security proof in the global command model for Kent's quantum protocol [Kent 2011, Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes]. The proof employs two fundamental principles of modern physics, the no-signalling property of relativity and the uncertainty principle of quantum mechanics.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Quantum tasks in Minkowski spaceClassical and Quantum Gravity, 2012
- Tight finite-key analysis for quantum cryptographyNature Communications, 2012
- WITHDRAWN: Quantum cryptography: Public key distribution and coin tossingTheoretical Computer Science, 2011
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications2007
- Secure Classical Bit Commitment Using Fixed Capacity Communication ChannelsJournal of Cryptology, 2005
- Commitment Capacity of Discrete Memoryless Channels2003
- Distributed Oblivious Transfer2000
- Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation2000
- Efficient Cryptographic Protocols Based on Noisy Channels1997
- A Provably-Secure Strongly-Randomized CipherLecture Notes in Computer Science, 1991