On the Black-Box Complexity of Optimally-Fair Coin Tossing

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)

Black-box use of one-way functions is useless for optimal fair coin-tossing
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
Can optimally-fair coin tossing be based on one-way functions?
Game-theoretically fair distributed sampling
Game theoretic notions of fairness in multi-party coin toss
On constructing one-way permutations from indistinguishability obfuscation
A lower bound for adaptively-secure collective coin flipping protocols
Communication lower bounds of key-agreement protocols via density increment arguments
On constructing one-way permutations from indistinguishability obfuscation
On the complexity of fair coin flipping
On fair exchange, fair coins and fair sampling
Structure versus hardness through the obfuscation lens
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
Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
Constant-round simulation-secure coin tossing extension with guaranteed output
Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
An optimally fair coin toss
Polynomial-time targeted attacks on coin tossing for any number of corruptions
Computational two-party correlation: a dichotomy for key-agreement protocols
A full characterization of functions that imply fair coin tossing and ramifications to fairness
On the complexity of fair coin flipping
Limits on the usefulness of random oracles
Computational hardness of optimal fair computation: beyond Minicrypt
On the (im)plausibility of public-key quantum money from collision-resistant hash functions

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)