The following pages link to An Optimally Fair Coin Toss (Q3611755):
Displaying 34 items.
- An optimally fair coin toss (Q315542) (← links)
- Partial fairness in secure two-party computation (Q421046) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- On the (im-)possibility of extending coin toss (Q1994641) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness (Q2175944) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Leakage-resilient coin tossing (Q2251154) (← links)
- Basing cryptographic protocols on tamper-evident seals (Q2268101) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- Polynomial-time targeted attacks on coin tossing for any number of corruptions (Q2697882) (← links)
- Achieving Optimal Fairness from Biased Coinflips (Q2708630) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- Robust Coin Flipping (Q2894407) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Leakage-Resilient Coin Tossing (Q3095326) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- On the (Im-)Possibility of Extending Coin Toss (Q3593114) (← links)
- (Q4480585) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- (Q5324280) (← links)
- Automata, Languages and Programming (Q5716782) (← links)
- On the complexity of fair coin flipping (Q5915598) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- On the complexity of fair coin flipping (Q5918656) (← links)
- \(\log^\ast\)-round game-theoretically-fair leader election (Q6108988) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- Expected linear round synchronization: the missing link for linear Byzantine SMR (Q6535025) (← links)
- Just how fair is an unreactive world? (Q6605334) (← links)
