Breaking the {\mathcal{O}}(n|C|) Barrier for Unconditionally Secure Asynchronous Multiparty Computation
From MaRDI portal
Publication:2872039
Recommendations
- Brief announcement: Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited
- Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
- Asynchronous secure multiparty computation in constant time
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- scientific article; zbMATH DE number 1583776
- The bottleneck complexity of secure multiparty computation
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
- scientific article; zbMATH DE number 1583939
- Efficient asynchronous verifiable secret sharing and multiparty computation
Cited in
(6)- Brief announcement: Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited
- Asynchronous secure multiparty computation in constant time
- Asynchronous Multi-Party Computation with Quadratic Communication
- scientific article; zbMATH DE number 1955785 (Why is no real title available?)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network
This page was built for publication: Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872039)