Coin Flipping with Constant Bias Implies One-Way Functions
From MaRDI portal
Recommendations
- Coin flipping with constant bias implies one-way functions
- Coin flipping of any constant bias implies one-way functions
- Coin flipping of \textit{any} constant bias implies one-way functions
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- From biased coin to any discrete distribution
- Biasing Boolean functions and collective coin-flipping protocols over arbitrary product distributions
- Can optimally-fair coin tossing be based on one-way functions?
- Von Neumann's biased coin revisited
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
Cited in
(12)- Game theoretic notions of fairness in multi-party coin toss
- An optimally fair coin toss
- Coin flipping of \textit{any} constant bias implies one-way functions
- Coin flipping of any constant bias implies one-way functions
- Coin flipping with constant bias implies one-way functions
- On the complexity of fair coin flipping
- On the complexity of fair coin flipping
- Game-theoretically fair distributed sampling
- Game-theoretically fair coin toss with arbitrary preferences
- Game theory does not always help: the case of statistical multi-party coin tossing
- A tight lower bound on adaptively secure full-information coin flip
- A lower bound for adaptively-secure collective coin flipping protocols
This page was built for publication: Coin Flipping with Constant Bias Implies One-Way Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494922)
