Linear-Communication Asynchronous Complete Secret Sharing with Optimal Resilience
摘要
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