On the Black-Box Complexity of Optimally-Fair Coin Tossing
From MaRDI portal
Publication:3000555
DOI10.1007/978-3-642-19571-6_27zbMATH Open1295.94044OpenAlexW1513068474MaRDI QIDQ3000555FDOQ3000555
Authors: Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin 
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
Recommendations
- On the complexity of fair coin flipping
- On the complexity of fair coin flipping
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- Fair coin flipping: tighter analysis and the many-party case
- Achieving Optimal Fairness from Biased Coinflips
- The average complexity of a coin-weighing problem
- A complete characterization of game-theoretically fair, multi-party coin toss
- Reducing the arity in unbiased black-box complexity
Cited In (26)
- A lower bound for adaptively-secure collective coin flipping protocols
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- An almost-optimally fair three-party coin-flipping protocol
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Computational hardness of optimal fair computation: beyond Minicrypt
- On constructing one-way permutations from indistinguishability obfuscation
- Communication lower bounds of key-agreement protocols via density increment arguments
- Game theoretic notions of fairness in multi-party coin toss
- Limits on the usefulness of random oracles
- On constructing one-way permutations from indistinguishability obfuscation
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- An optimally fair coin toss
- On the complexity of fair coin flipping
- Can optimally-fair coin tossing be based on one-way functions?
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
- On the complexity of collision resistant hash functions: new and old black-box separations
- Structure versus hardness through the obfuscation lens
- Game-theoretically fair distributed sampling
- On fair exchange, fair coins and fair sampling
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Polynomial-time targeted attacks on coin tossing for any number of corruptions
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- Computational two-party correlation: a dichotomy for key-agreement protocols
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- On the complexity of fair coin flipping
This page was built for publication: On the Black-Box Complexity of Optimally-Fair Coin Tossing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000555)
