A lower bound for adaptively-secure collective coin-flipping protocols
DOI10.4230/LIPICS.DISC.2018.34OpenAlexW2896792124MaRDI QIDQ5090927FDOQ5090927
Authors: Kalai Yael Tauman, Ilan Komargodski, Ran Raz 
Publication date: 21 July 2022
Full work available at URL: http://dblp.uni-trier.de/db/conf/wdag/disc2018.html#KalaiKR18
Recommendations
- A lower bound for adaptively-secure collective coin flipping protocols
- Adaptively secure coin-flipping, revisited
- Lower bounds for leader election and collective coin-flipping in the perfect information model
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- A Robust Noncryptographic Protocol for Collective Coin Flipping
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)
Cites Work
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- An optimally fair coin toss
- A Robust Noncryptographic Protocol for Collective Coin Flipping
- Coin-Flipping Games Immune against Linear-Sized Coalitions
- Concentration of measure for the analysis of randomized algorithms.
- The influence of large coalitions
- Compressing communication in distributed protocols
- Protocols for multiparty coin toss with a dishonest majority
- 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
- Fair coin flipping: tighter analysis and the many-party case
- Some extremal problems arising from discrete control processes
- The Biased Coin Problem
Cited In (7)
- A lower bound for adaptively-secure collective coin flipping protocols
- Random Selection with an Adversarial Majority
- A Robust Noncryptographic Protocol for Collective Coin Flipping
- Adaptively secure coin-flipping, revisited
- Title not available (Why is that?)
- Completeness theorems for adaptively secure broadcast
- Polynomial-time targeted attacks on coin tossing for any number of corruptions
This page was built for publication: A lower bound for adaptively-secure collective coin-flipping protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090927)
