Pages that link to "Item:Q2968163"
From MaRDI portal
The following pages link to An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163):
Displaying 20 items.
- An optimally fair coin toss (Q315542) (← links)
- A lower bound for adaptively-secure collective coin flipping protocols (Q822636) (← links)
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← 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)
- Polynomial-time targeted attacks on coin tossing for any number of corruptions (Q2697882) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← 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)
- (Q5259575) (redirect page) (← 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)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
