Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency

Yuval Gelles, Ilan Komargodski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Designing efficient distributed protocols for various agreement tasks such as Byzantine Agreement, Broadcast, and Committee Election is a fundamental problem. We are interested in scalable protocols for these tasks, where each (honest) party communicates a number of bits which is sublinear in n, the number of parties. The first major step towards this goal is due to King et al. (SODA 2006) who showed a protocol where each party sends only Õ(1)1 bits throughout Õ(1) rounds, but guarantees only that 1 - o(1) fraction of honest parties end up agreeing on a consistent output, assuming constant < 1/3 fraction of static corruptions. Few years later, King et al. (ICDCN 2011) managed to get a full agreement protocol in the same model but where each party sends Õ(√n) bits throughout Õ(1) rounds. Getting a full agreement protocol with o(√n) communication per party has been a major challenge ever since. In light of this barrier, we propose a new framework for designing efficient agreement protocols. Specifically, we design Õ(1)-round protocols for all of the above tasks (assuming constant < 1/3 fraction of static corruptions) with optimistic and pessimistic guarantees: Optimistic complexity: In an honest execution, all parties send only Õ(1) bits. Pessimistic complexity: In any other case, (honest) parties send Õ(√n) bits. Thus, all an adversary can gain from deviating from the honest execution is that honest parties will need to work harder (i.e., transmit more bits) to reach agreement and terminate. Besides the above agreement tasks, we also use our new framework to get a scalable secure multiparty computation (MPC) protocol with optimistic and pessimistic complexities. Technically, we identify a relaxation of Byzantine Agreement (of independent interest) that allows us to fall-back to a pessimistic execution in a coordinated way by all parties. We implement this relaxation with Õ(1) communication bits per party and within Õ(1) rounds.

Original languageAmerican English
Title of host publication37th International Symposium on Distributed Computing, DISC 2023
EditorsRotem Oshman
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages42:1-42:6
Number of pages6
ISBN (Electronic)9783959773010
DOIs
StatePublished - Oct 2023
Event37th International Symposium on Distributed Computing, DISC 2023 - L'Aquila, Italy
Duration: 10 Oct 202312 Oct 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume281
ISSN (Print)1868-8969

Conference

Conference37th International Symposium on Distributed Computing, DISC 2023
Country/TerritoryItaly
CityL'Aquila
Period10/10/2312/10/23

Bibliographical note

Publisher Copyright:
© Yuval Gelles and Ilan Komargodski; licensed under Creative Commons License CC-BY 4.0.

Keywords

  • Byzantine Agreement
  • Consensus
  • Optimistic-Pessimistic
  • Secure Multi-Party Computation

Fingerprint

Dive into the research topics of 'Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency'. Together they form a unique fingerprint.

Cite this