On the complexity of fair coin flipping
From MaRDI portal
Publication:5915598
DOI10.1007/978-3-030-03807-6_20zbMath1443.94059arXiv2105.00780OpenAlexW2805054829MaRDI QIDQ5915598
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Publication date: 11 December 2018
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00780
Related Items (9)
A lower bound for adaptively-secure collective coin flipping protocols ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ On the complexity of fair coin flipping ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
Cites Work
- An optimally fair coin toss
- 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
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- An Optimally Fair Coin Toss
- Coin Flipping of Any Constant Bias Implies One-Way Functions
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
- Probability Inequalities for Sums of Bounded Random Variables
- Coin Flipping with Constant Bias Implies One-Way Functions
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
This page was built for publication: On the complexity of fair coin flipping
