The following pages link to (Q2707598):
Displaying 11 items.
- Batch secret sharing for secure multi-party computation in asynchronous network (Q615211) (← links)
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Reducing communication costs in robust peer-to-peer networks (Q963355) (← links)
- Robust random number generation for peer-to-peer systems (Q1004308) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- Perfect asynchronous MPC with linear communication overhead (Q6637548) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)
- Linear-communication asynchronous complete secret sharing with optimal resilience (Q6653035) (← links)
