The following pages link to An optimally fair coin toss (Q315542):
Displaying 19 items.
- A lower bound for adaptively-secure collective coin flipping protocols (Q822636) (← links)
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- On the (im-)possibility of extending coin toss (Q1994641) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- Achieving Optimal Fairness from Biased Coinflips (Q2708630) (← links)
- Robust Coin Flipping (Q2894407) (← links)
- An Optimally Fair Coin Toss (Q3611755) (← links)
- (Q4480585) (← links)
- A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols (Q5090927) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- Coin flipping from a cosmic source: On error correction of truly random bits (Q5311898) (← links)
- (Q5324280) (← links)
- On the complexity of fair coin flipping (Q5915598) (← links)
- On the complexity of fair coin flipping (Q5918656) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
- Game-theoretically fair distributed sampling (Q6653028) (← links)
