Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time

ePrint Report: Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time

Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern

A major challenge of any asynchronous MPC protocol is the need to reach agreement on the set of private inputs to be used as input for the MPC functionality. Ben-Or, Canetti and Goldreich [STOC 93] call this problem Agreement on a Core Set (ACS) and solve it by running $n$ parallel instances of asynchronous binary Byzantine agreements. To …

asynchronous challenge eprint report input inputs major mpc private protocol report stern