Pages that link to "Item:Q2018817"
From MaRDI portal
The following pages link to Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817):
Displaying 19 items.
- Batch secret sharing for secure multi-party computation in asynchronous network (Q615211) (← links)
- Amortized complexity of information-theoretically secure MPC revisited (Q775982) (← links)
- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network (Q1705716) (← links)
- 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)
- (Q2757242) (← links)
- Efficient Asynchronous Accumulators for Distributed PKI (Q2827725) (← links)
- Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation (Q2872039) (← links)
- On the complexity of verifiable secret sharing and multiparty computation (Q3192000) (← links)
- Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience (Q3558312) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← 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)
- Network-agnostic multi-party computation revisited (extended abstract) (Q6635768) (← 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)