Pages that link to "Item:Q2018817"
From MaRDI portal
The following pages link to Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817):
Displaying 10 items.
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation (Q2152067) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← 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)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries (Q6169465) (← links)
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation (Q6186586) (← links)
- Network-agnostic security comes (almost) for free in DKG and MPC (Q6186588) (← links)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)