Pages that link to "Item:Q3519524"
From MaRDI portal
The following pages link to Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524):
Displaying 10 items.
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
