Multiparty quantum coin flipping

Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: We propose and motivate a definition for quantum broadcast. Our model of quantum broadcast channel is new. We discovered that quantum broadcast is essentially a combination of pairwise quantum channels and a classical broadcast channel. This is a somewhat surprising conclusion, but helps us in both our lower and upper bounds. We provide tight upper and lower bounds on the optimal bias ε of a coin which can be flipped by k parties of which exactly g parties are honest: for any 1≤g≤k,ε=1/2-⊖(g/k). Thus, as long as a constant fraction of the players are honest, they can prevent the coin from being fixed with at least a constant probability. This result stands in sharp contrast with the classical setting, where no non-trivial coin-flipping is possible when g ≤ k/2.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual IEEE Conference on Computational Complexity
Pages250-259
Number of pages10
Volume19
StatePublished - 2004
EventProceedings - 19th IEEE Annual Conference on Computational Complexity - Amherst, MA, United States
Duration: Jun 21 2004Jun 24 2004

Other

OtherProceedings - 19th IEEE Annual Conference on Computational Complexity
CountryUnited States
CityAmherst, MA
Period6/21/046/24/04

Fingerprint

Broadcast
Broadcast Channel
Upper and Lower Bounds
Quantum Channel
Pairwise
Model

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Ambainis, A., Buhrman, H., Dodis, Y., & Röhrig, H. (2004). Multiparty quantum coin flipping. In Proceedings of the Annual IEEE Conference on Computational Complexity (Vol. 19, pp. 250-259)

Multiparty quantum coin flipping. / Ambainis, Andris; Buhrman, Harry; Dodis, Yevgeniy; Röhrig, Hein.

Proceedings of the Annual IEEE Conference on Computational Complexity. Vol. 19 2004. p. 250-259.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ambainis, A, Buhrman, H, Dodis, Y & Röhrig, H 2004, Multiparty quantum coin flipping. in Proceedings of the Annual IEEE Conference on Computational Complexity. vol. 19, pp. 250-259, Proceedings - 19th IEEE Annual Conference on Computational Complexity, Amherst, MA, United States, 6/21/04.
Ambainis A, Buhrman H, Dodis Y, Röhrig H. Multiparty quantum coin flipping. In Proceedings of the Annual IEEE Conference on Computational Complexity. Vol. 19. 2004. p. 250-259
Ambainis, Andris ; Buhrman, Harry ; Dodis, Yevgeniy ; Röhrig, Hein. / Multiparty quantum coin flipping. Proceedings of the Annual IEEE Conference on Computational Complexity. Vol. 19 2004. pp. 250-259
@inproceedings{7935fdc5be87497bb613fe4bbb79a6ad,
title = "Multiparty quantum coin flipping",
abstract = "We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: We propose and motivate a definition for quantum broadcast. Our model of quantum broadcast channel is new. We discovered that quantum broadcast is essentially a combination of pairwise quantum channels and a classical broadcast channel. This is a somewhat surprising conclusion, but helps us in both our lower and upper bounds. We provide tight upper and lower bounds on the optimal bias ε of a coin which can be flipped by k parties of which exactly g parties are honest: for any 1≤g≤k,ε=1/2-⊖(g/k). Thus, as long as a constant fraction of the players are honest, they can prevent the coin from being fixed with at least a constant probability. This result stands in sharp contrast with the classical setting, where no non-trivial coin-flipping is possible when g ≤ k/2.",
author = "Andris Ambainis and Harry Buhrman and Yevgeniy Dodis and Hein R{\"o}hrig",
year = "2004",
language = "English (US)",
volume = "19",
pages = "250--259",
booktitle = "Proceedings of the Annual IEEE Conference on Computational Complexity",

}

TY - GEN

T1 - Multiparty quantum coin flipping

AU - Ambainis, Andris

AU - Buhrman, Harry

AU - Dodis, Yevgeniy

AU - Röhrig, Hein

PY - 2004

Y1 - 2004

N2 - We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: We propose and motivate a definition for quantum broadcast. Our model of quantum broadcast channel is new. We discovered that quantum broadcast is essentially a combination of pairwise quantum channels and a classical broadcast channel. This is a somewhat surprising conclusion, but helps us in both our lower and upper bounds. We provide tight upper and lower bounds on the optimal bias ε of a coin which can be flipped by k parties of which exactly g parties are honest: for any 1≤g≤k,ε=1/2-⊖(g/k). Thus, as long as a constant fraction of the players are honest, they can prevent the coin from being fixed with at least a constant probability. This result stands in sharp contrast with the classical setting, where no non-trivial coin-flipping is possible when g ≤ k/2.

AB - We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: We propose and motivate a definition for quantum broadcast. Our model of quantum broadcast channel is new. We discovered that quantum broadcast is essentially a combination of pairwise quantum channels and a classical broadcast channel. This is a somewhat surprising conclusion, but helps us in both our lower and upper bounds. We provide tight upper and lower bounds on the optimal bias ε of a coin which can be flipped by k parties of which exactly g parties are honest: for any 1≤g≤k,ε=1/2-⊖(g/k). Thus, as long as a constant fraction of the players are honest, they can prevent the coin from being fixed with at least a constant probability. This result stands in sharp contrast with the classical setting, where no non-trivial coin-flipping is possible when g ≤ k/2.

UR - http://www.scopus.com/inward/record.url?scp=4944255012&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4944255012&partnerID=8YFLogxK

M3 - Conference contribution

VL - 19

SP - 250

EP - 259

BT - Proceedings of the Annual IEEE Conference on Computational Complexity

ER -