Unconditionally secure relativistic multi-party biased coin flipping and die rolling
arXiv:2107.09196 · doi:10.1098/rspa.2021.0203
Abstract
We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to parties and to outcomes for any chosen outcome biases, and show them unconditionally secure. Our results prove that the most general random secure multi-party computation, where all parties receive the output and there is no secret input by any party, can be implemented with unconditional security. Our protocols extend Kent's [A. Kent, Phys. Rev. Lett. 83, 5382 (1999)] two-party unbiased coin flipping protocol, do not require any quantum communication, are practical to implement with current technology, and to our knowledge are the first multi-party relativistic cryptographic protocols.
arXiv commentMinor typos corrected and some references updated. Accepted version
References in corpus (47)
- The Quantum Internet
- Satellite-to-ground quantum key distribution
- Satellite-relayed intercontinental quantum network
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Insecurity of Quantum Secure Computations
- Towards a global quantum network
- Degrees of concealment and bindingness in quantum bit commitment protocols
- Long-distance quantum key distribution secure against coherent attacks
- Unconditionally Secure Bit Commitment
- Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
- Cryptography from Noisy Storage
- Experimental Quantum Coin Tossing
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- Experimental bit commitment based on quantum communication and special relativity
- Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
- Unconditionally Secure Bit Commitment with Flying Qudits
- The Impossibility Of Secure Two-Party Classical Computation
- Experimental implementation of bit commitment in the noisy-storage model
- An Experimental Implementation of Oblivious Transfer in the Noisy Storage Model
- On bit-commitment based quantum coin flipping
- Experimental plug&play quantum coin flipping
- Experimental unconditionally secure bit commitment
- Quantum Tasks in Minkowski Space
- Flipping quantum coins
- Coin Tossing is Strictly Weaker Than Bit Commitment
- Practical relativistic bit commitment
- Device-Independent Relativistic Quantum Bit Commitment
- Fair Loss-Tolerant Quantum Coin Flipping
- 24-Hour Relativistic Bit Commitment
- Quantum dice rolling: A multi-outcome generalization of quantum coin flipping
- Experimental quantum tossing of a single coin
- Spacetime-constrained oblivious transfer
- Location-Oblivious Data Transfer with Flying Entangled Qudits
- Quantum coin tossing and bit-string generation in the presence of noise
- Variable Bias Coin Tossing
- Provably Secure Experimental Quantum Bit-String Generation
- Arbitrarily long relativistic bit commitment
- Practical and unconditionally secure spacetime-constrained oblivious transfer
- Multiphoton and side-channel attacks in mistrustful quantum cryptography
- An Entanglement-Based Protocol For Strong Coin Tossing With Bias 1/4
- Composable security in relativistic quantum cryptography
- One-out-of- spacetime-constrained oblivious transfer
- Security of Quantum Bit-String Generation
- Experimental relativistic zero-knowledge proofs
- A family of loss-tolerant quantum coin flipping protocols
- Deterministic Relativistic Quantum Bit Commitment