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

DOI10.1007/978-3-319-03515-4_2MaRDI QIDQ2872039zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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
• Efficient secure multi-party computation. (Extended Abstract)
• The bottleneck complexity of secure multiparty computation
• Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
• Efficient asynchronous secure multiparty distributed computation
• Efficient asynchronous verifiable secret sharing and multiparty computation

Cited in

(6)

• Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Asynchronous secure multiparty computation in constant time
• Asynchronous Multi-Party Computation with Quadratic Communication
• Asynchronous unconditionally secure computation: An efficiency improvement
• Brief announcement: Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited

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)