Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

DOI10.1007/11593447_5zbMATH Open1154.94457OpenAlexW1763785618MaRDI QIDQ5451065FDOQ5451065

Martin Hirt, Jesper Buus Nielsen

Publication date: 18 March 2008

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

Full work available at URL: https://doi.org/10.1007/11593447_5

Recommendations

• Robust Multiparty Computation with Linear Communication Complexity
• scientific article; zbMATH DE number 7706034
• The broadcast message complexity of secure multiparty computation
• Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
• Communication lower bounds for statistically secure MPC, with or without preprocessing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (6)

• Tight bounds for the multiplicative complexity of symmetric functions
• Robust Multiparty Computation with Linear Communication Complexity
• A direct product theorem for two-party bounded-round public-coin communication complexity
• Secure Protocol Transformations
• The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
• Multi-party computation with conversion of secret sharing

This page was built for publication: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451065)