Asynchronous MPC with a strict honest majority using non-equivocation
Michael Backes, Fabian Bendun, Ashish Choudhury, Aniket Kate · 2014
Multiparty computation (MPC) among n parties can tolerate up to t<n/2 active corruptions in a synchronous communication setting; however, in an asynchronous communication setting, the resiliency bound decreases to only t < n/3 active corruptions. We improve the resiliency bound for asynchronous MPC (AMPC) to match synchronous MPC using non-equivocation.