Pages that link to "Item:Q4910281"
From MaRDI portal
The following pages link to A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness (Q4910281):
Displaying 10 items.
- 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)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← 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)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- On secure computation of solitary output functionalities with and without broadcast (Q6582168) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
