Common Contracts
1 similar null contracts
Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected TimeJuly 20th, 2023
Abstract. 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 run- ning n parallel instances of asynchronous binary Byzantine agreements. To the best of our knowledge, all results in the perfect and statistical security setting used this same paradigm for solving ACS. This leads to a fundamental barrier of expected Ω(log n) rounds for any asynchronous MPC protocol (even for constant depth circuits).
