The following pages link to (Q5002694):
Displaying 5 items.
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity (Q6595687) (← links)
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably (Q6653024) (← links)
