Revisiting Byzantine Agreement and MPC in Bounded-Delay Networks
Abstract
Secure multi-party computation (MPC) is one of the most important and fundamental problems in distributed computing. MPC allows a set of parties to compute an arbitrary function of their (potentially private) inputs in a secure way even in the presence of an adversary. The problem has been studied extensively in the synchronous setting, where it is assumed that there exists a global clock and the delay of any message in the network is bounded. However, though theoretically impressive, such networks do not model adequately real-life networks, like the Internet.
In this work, we present the first construction for MPC in the partial synchronous setting, where there’s an unknown bounded delay on the message delivery time. Our protocol achieves optimal resilience, involving n = 3t + 1 parties and tolerating a malicious adversary, capable of corrupting up to t parties.
Citation
Elsheimy, Fatmaelzahraa (2022). Revisiting Byzantine Agreement and MPC in Bounded-Delay Networks. Master's thesis, Texas A&M University. Available electronically from https : / /hdl .handle .net /1969 .1 /198149.