Pages that link to "Item:Q5199197"
From MaRDI portal
The following pages link to 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds (Q5199197):
Displaying 16 items.
- An optimally fair coin toss (Q315542) (← 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)
- 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)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← 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)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
- Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
