On the Black-Box Complexity of Optimally-Fair Coin Tossing
From MaRDI portal
Publication:3000555
DOI10.1007/978-3-642-19571-6_27zbMath1295.94044OpenAlexW1513068474MaRDI QIDQ3000555
Yehuda Lindell, Mohammad Mahmoody, Tal Malkin, Dana Dachman-Soled
Publication date: 19 May 2011
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_27
Related Items (20)
A lower bound for adaptively-secure collective coin flipping protocols ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Limits on the usefulness of random oracles ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ An optimally fair coin toss ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ 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 ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ On the complexity of fair coin flipping ⋮ On the complexity of fair coin flipping ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: On the Black-Box Complexity of Optimally-Fair Coin Tossing
