Pages that link to "Item:Q1698398"
From MaRDI portal
The following pages link to Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398):
Displaying 6 items.
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
