A Robust Noncryptographic Protocol for Collective Coin Flipping

DOI10.1137/0402020MaRDI QIDQ3824138zbMATH OpenOpenAlexFDO

Authors Michael 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

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

Recommendations

• scientific article; zbMATH DE number 4106654
• A lower bound for adaptively-secure collective coin flipping protocols
• A lower bound for adaptively-secure collective coin-flipping protocols
• Coin-Flipping Games Immune against Linear-Sized Coalitions
• Protocols for multiparty coin toss with a dishonest majority

Cited in

(14)

• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Fast perfect-information leader-election protocols with linear immunity
• High entropy random selection protocols
• An optimally fair coin toss
• Rationality in the Full-Information Model
• Transmutation scheme of coin flipping protocol and utilization
• scientific article; zbMATH DE number 4106654 (Why is no real title available?)
• A lower bound for adaptively-secure collective coin-flipping protocols
• The influence of large coalitions
• Fair coin flipping: tighter analysis and the many-party case
• Unconditionally secure relativistic multi-party biased coin flipping and die rolling
• Byzantine agreement with optimal resilience via statistical fraud detection
• A tight lower bound on adaptively secure full-information coin flip
• A lower bound for adaptively-secure collective coin flipping protocols

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3824138)