Linear-Communication Asynchronous Complete Secret Sharing with Optimal Resilience

ePrint Report: Linear-Communication Asynchronous Complete Secret Sharing with Optimal Resilience

Xiaoyu Ji, Junru Li, Yifan Song

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 \emph{asynchronous network} setting with optimal resilience ($t

Our work closes this gap by presenting the first ACSS protocol that achieves $O(n\kappa)$ bits per sharing. When combined with the compiler from ACSS to AMPC by …

asynchronous communication computation compute eprint report focus function information inputs linear mpc network private report resilience secret secure multiparty computation sharing song work