Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication

Download PDF
Open Webpage

Junru Li, Yifan Song

Published: 01 Jan 2025, Last Modified: 03 Sept 2025CRYPTO (4) 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this work, we consider secure multiparty computation (MPC) in the asynchronous network setting. MPC allows n parties to compute a public function on their private inputs against an adversary corrupting at most t of them. We consider both communication complexity and round complexity of asynchronous MPC (AMPC) with the optimal resilience \(n=3t+1\).