Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization

Ittai Abraham, Ling Ren, Zhuolun Xiang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper studies the good-case latency of unauthenticated Byzantine fault-tolerant broadcast, which measures the time it takes for all non-faulty parties to commit given a non-faulty broadcaster. For both asynchrony and synchrony, we show that n ≥ 4f is the tight resilience threshold that separates good-case 2 rounds and 3 rounds. For asynchronous Byzantine reliable broadcast (BRB), we also investigate the bad-case latency for all non-faulty parties to commit when the broadcaster is faulty but some non-faulty party commits. We provide matching upper and lower bounds on the resilience threshold of bad-case latency for BRB protocols with optimal good-case latency of 2 rounds. In particular, we show 2 impossibility results and propose 4 asynchronous BRB protocols.

Original languageEnglish (US)
Title of host publication25th International Conference on Principles of Distributed Systems, OPODIS 2021
EditorsQuentin Bramas, Vincent Gramoli, Vincent Gramoli, Alessia Milani
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772198
DOIs
StatePublished - Feb 1 2022
Event25th International Conference on Principles of Distributed Systems, OPODIS 2021 - Strasbourg, France
Duration: Dec 13 2021Dec 15 2021

Publication series

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

Conference

Conference25th International Conference on Principles of Distributed Systems, OPODIS 2021
Country/TerritoryFrance
CityStrasbourg
Period12/13/2112/15/21

Keywords

  • Asynchrony
  • Byzantine broadcast
  • Good-case
  • Latency
  • Optimal
  • Synchrony

ASJC Scopus subject areas

  • Software

Cite this