Unconditionally secure relativistic multi-party biased coin flipping and die rolling

Abstract

We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to $M\ge 2$ parties and to $N\ge 2$ 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.

Minor typos corrected and some references updated. Accepted version

References in corpus (12)

• The Quantum Internet
• Satellite-to-ground quantum key distribution
• Towards a global quantum network
• Long-distance quantum key distribution secure against coherent attacks
• Cryptography from Noisy Storage
• Experimental quantum tossing of a single coin
• Variable Bias Coin Tossing
• Multiphoton and side-channel attacks in mistrustful quantum cryptography
• An Entanglement-Based Protocol For Strong Coin Tossing With Bias 1/4
• One-out-of-$m$ spacetime-constrained oblivious transfer
• Experimental relativistic zero-knowledge proofs
• A family of loss-tolerant quantum coin flipping protocols

Cited by in corpus (2)

• Multiphoton and side-channel attacks in mistrustful quantum cryptography
• Quantum cryptography beyond key distribution: theory and experiment