Breaking the {\mathcal{O}}(n|C|) Barrier for Unconditionally Secure Asynchronous Multiparty Computation

DOI10.1007/978-3-319-03515-4_2zbMATH Open1295.94038OpenAlexW114313705MaRDI QIDQ2872039FDOQ2872039

Authors: Ashish Choudhury 

Publication date: 14 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03515-4_2

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (4)

• Asynchronous Multi-Party Computation with Quadratic Communication
• Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network
• Title not available (Why is that?)
• Asynchronous secure multiparty computation in constant time

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)