Linear-Communication Asynchronous Complete Secret Sharing with Optimal Resilience

Xiaoyu Ji, Junru Li, Yifan Song

Abstract: Secure multiparty computation (MPC) allows a set of n parties to jointly compute a function on their private inputs. In this work, we focus on the information-theoretic MPC in the asynchronous network setting with optimal resilience (\(t<n/3\)). The best-known result in this setting is achieved by Choudhury and Patra [J. Cryptol ’23], which requires \(O(n^4\kappa )\) bits per multiplication gate, where \(\kappa \) is the size of a field element.