@inproceedings{4a966e9c2f924cb6bc110c36d7bf0dc0,
title = "Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words",
abstract = "Byzantine Agreement (BA) is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with O(n(f + 1)) communication complexity in a model with resilience of n = 2t + 1, where 0 ≤ f ≤ t is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in the failure-free case and a quadratic cost otherwise.",
keywords = "Adaptive communication, Byzantine Agreement, Byzantine Broadcast",
author = "Shir Cohen and Idit Keidar and Alexander Spiegelman",
note = "Publisher Copyright: {\textcopyright} Shir Cohen, Idit Keidar, and Alexander Spiegelman.; 26th International Conference on Principles of Distributed Systems, OPODIS 2022 ; Conference date: 13-12-2022 Through 15-12-2022",
year = "2023",
month = feb,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.OPODIS.2022.18",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Eshcar Hillel and Roberto Palmieri and Etienne Riviere",
booktitle = "26th International Conference on Principles of Distributed Systems, OPODIS 2022",
}