A Robust Noncryptographic Protocol for Collective Coin Flipping

DOI10.1137/0402020zbMath0671.90109OpenAlexW1980985945MaRDI QIDQ3824138

Michael E. Saks

Publication date: 1989

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0402020

zbMATH Keywords

asynchronous perfect information gamedishonest playersglobal coin flipping

Mathematics Subject Classification ID

Game theory (91A99) Permutations, words, matrices (05A05) Discrete mathematics in relation to computer science (68R99)

Related Items (9)

A lower bound for adaptively-secure collective coin flipping protocols ⋮ An optimally fair coin toss ⋮ Fast perfect-information leader-election protocols with linear immunity ⋮ High entropy random selection protocols ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ The influence of large coalitions ⋮ A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols ⋮ Rationality in the Full-Information Model ⋮ Perfect information leader election in \(\log^*n+O(1)\) rounds

This page was built for publication: A Robust Noncryptographic Protocol for Collective Coin Flipping