A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols

DOI10.4230/LIPICS.DISC.2018.34OpenAlexW2896792124MaRDI QIDQ5090927

Ran Raz, Kalai Yael Tauman, Ilan Komargodski

Publication date: 21 July 2022

Full work available at URL: http://dblp.uni-trier.de/db/conf/wdag/disc2018.html#KalaiKR18

zbMATH Keywords

lower boundcoin flippingByzantine faultsadaptive corruptions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (2)

Completeness theorems for adaptively secure broadcast ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions

Cites Work

• Unnamed Item
• An optimally fair coin toss
• The influence of large coalitions
• Some extremal problems arising from discrete control processes
• Compressing communication in distributed protocols
• Protocols for multiparty coin toss with a dishonest majority
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
• Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
• Adaptively Secure Coin-Flipping, Revisited
• A Robust Noncryptographic Protocol for Collective Coin Flipping
• Coin-Flipping Games Immune against Linear-Sized Coalitions
• Fair Coin Flipping: Tighter Analysis and the Many-Party Case
• The Biased Coin Problem
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols