Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries

Ananya Appan; Anirudh Chandramouli; Ashish Choudhury

Paper 2022/651

Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries

Ananya Appan, International Institute of Information Technology, Bangalore

Anirudh Chandramouli, International Institute of Information Technology, Bangalore

Ashish Choudhury, International Institute of Information Technology, Bangalore

Abstract

In this paper, we design secure multi-party computation (MPC) protocols in the asynchronous communication setting with optimal resilience. Our protocols are secure against a computationally-unbounded malicious adversary, characterized by an adversary structure $Z$ , which enumerates all possible subsets of potentially corrupt parties. Our protocols incur a communication of $O (| Z |^{2})$ and $O (| Z |)$ bits per multiplication for perfect and statistical security respectively. These are the first protocols with this communication complexity, as such protocols were known only in the synchronous communication setting (Hirt and Tschudi, ASIACRYPT 2013).

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published by the IACR in JOC 2023
Keywords: Byzantine faults unconditional-security Byzantine agreement secret sharing privacy Multi Party Computation
Contact author(s): ananya appan @ iiitb ac in
anirudh c @ iiitb ac in
ashish choudhury @ iiitb ac in
History: 2023-03-19: last of 2 revisions; 2022-05-26: received; See all versions
Short URL: https://ia.cr/2022/651
License: CC BY

BibTeX

@misc{cryptoeprint:2022/651,
      author = {Ananya Appan and Anirudh Chandramouli and Ashish Choudhury},
      title = {Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/651},
      year = {2022},
      url = {https://eprint.iacr.org/2022/651}
}