The following pages link to Broadcast-optimal two-round MPC (Q2119034):
Displaying 14 items.
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- White box traitor tracing (Q2139638) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Minimizing setup in broadcast-optimal two round MPC (Q6061355) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels (Q6619925) (← links)
- Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs (Q6653036) (← links)
