Pages that link to "Item:Q2697681"
From MaRDI portal
The following pages link to On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681):
Displaying 12 items.
- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network (Q1705716) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Communication-efficient unconditional MPC with guaranteed output delivery (Q2304979) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience (Q3558312) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)
- Lightweight asynchronous verifiable secret sharing with optimal resilience (Q6570529) (← links)
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! (Q6579852) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)
- Linear-communication asynchronous complete secret sharing with optimal resilience (Q6653035) (← links)
