On the Communication Complexity of Secure Multi-Party Computation With Aborts

• Published in: arXiv.org
• Main Authors: Bartusek, James, Bergamaschi, Thiago, Khoury, Seri, Mutreja, Saachi, Orr Paradise
• Format: Paper
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 11.06.2024
• Subjects: Broadcasting; Communication; Complexity; Computation; Cryptography

A central goal of cryptography is Secure Multi-party Computation (MPC), where \(n\) parties desire to compute a function of their joint inputs without letting any party learn about the inputs of its peers. Unfortunately, it is well-known that MPC guaranteeing output delivery to every party is infeas...