International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC

Authors:
Ittai Abraham , Intel Labs
Gilad Asharov , Bar-Ilan University
Arpita Patra , IISc Bangalore
Gilad Stern , Tel Aviv University
Download:
Search ePrint
Search Google
Conference: TCC 2024
Abstract: A major challenge of any asynchronous MPC protocol is the need to reach an 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 the best of our knowledge, all results in the perfect and statistical security setting used this same paradigm for solving ACS. Using all known asynchronous binary Byzantine agreement protocols, this type of ACS has Omega(log n) expected round complexity, which results in such a bound on the round complexity of MPC protocols as well (even for constant depth circuits). We provide a new solution for Agreement on a Core Set that runs in expected O(1) rounds. Our perfectly secure variant is optimally resilient (t
BibTeX
@inproceedings{tcc-2024-34758,
  title={Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC},
  publisher={Springer-Verlag},
  author={Ittai Abraham and Gilad Asharov and Arpita Patra and Gilad Stern},
  year=2024
}