Multiparty Quantum Coin Flipping

Authors:
Andris Ambainis;Harry Buhrman;Yevgeniy Dodis;Hein Rohrig
Affiliations:
IAS and U. of Latvia;CWI and U. of Amsterdam;New York University;U. of Calgary
Venue:
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Year:
2004

Citing 0
Cited 11

Toward a general theory of quantum games

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
High Entropy Random Selection Protocols

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
An Optimally Fair Coin Toss

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Tight bounds for classical and quantum coin flipping

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Quantum anonymous transmissions

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Exact quantum algorithms for the leader election problem

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Exact Quantum Algorithms for the Leader Election Problem

ACM Transactions on Computation Theory (TOCT)
On the (im-)possibility of extending coin toss

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Semi-loss-tolerant strong coin flipping protocol using EPR pairs

Quantum Information & Computation
Lower bounds for quantum oblivious transfer

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate coin-flipping protocols for multiple partiesin a quantum broadcast setting:We propose and motivate a definition for quantumbroadcast. Our model of quantum broadcast channelis new.We discovered that quantum broadcast is essentiallya combination of pairwise quantum channels and aclassical broadcast channel. This is a somewhat surprisingconclusion, but helps us in both our lower andupper bounds.We provide tight upper and lower bounds on the optimalbias \varepsilon of a coin which can be flipped by k partiesof which exactly g parties are honest: for any1 \le g \le k,\varepsilon= \frac{1}{2} - \Theta (\frac{g}{k}).Thus, as long as a constant fraction of the players are honest,they can prevent the coin from being fixed with at leasta constant probability. This result stands in sharp contrastwith the classical setting, where no non-trivial coin-flippingis possible when g \le \frac{k}{2}.