A lower bound for adaptively-secure collective coin flipping protocols
From MaRDI portal
Publication:822636
DOI10.1007/S00493-020-4147-4zbMath1488.68030OpenAlexW3108497749MaRDI QIDQ822636
Ran Raz, Ilan Komargodski, Yael Tauman Kalai
Publication date: 22 September 2021
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9823/
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Communication complexity, information complexity (68Q11)
Cites Work
- 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
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- Lower bounds for distributed coin-flipping and randomized consensus
- 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
- Coin Flipping of Any Constant Bias Implies One-Way Functions
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case
- Perfect-Information Leader Election with Optimal Resilience
- Coin Flipping with Constant Bias Implies One-Way Functions
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
- Concentration of Measure for the Analysis of Randomized Algorithms
- On the complexity of fair coin flipping
This page was built for publication: A lower bound for adaptively-secure collective coin flipping protocols
