Pages that link to "Item:Q3611756"
From MaRDI portal
The following pages link to Complete Fairness in Multi-party Computation without an Honest Majority (Q3611756):
Displaying 13 items.
- Partial fairness in secure two-party computation (Q421046) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)