Communication efficient statistical asynchronous multiparty computation with optimal resilience
From MaRDI portal
Recommendations
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Simple and Efficient Perfectly-Secure Asynchronous MPC
Cited in
(10)- Efficient asynchronous verifiable secret sharing and multiparty computation
- MPC with synchronous security and asynchronous responsiveness
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Asynchronous MPC with a strict honest majority using non-equivocation
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Making Asynchronous Distributed Computations Robust to Channel Noise
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Communication-Efficient Accurate Statistical Estimation
- Brief announcement: Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited
- Information-theoretic network-agnostic MPC with polynomial communication
This page was built for publication: Communication efficient statistical asynchronous multiparty computation with optimal resilience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056895)