2000 character limit reached
Make Every Word Count: Adaptive BA with Fewer Words (2202.09123v2)
Published 18 Feb 2022 in cs.DC
Abstract: Byzantine Agreement 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, where $0\leq f\leq 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.
- Hot-stuff the linear, optimal-resilience, one-message bft devil. CoRR, abs/1803.05069, 2018.
- Asymptotically optimal validated asynchronous byzantine agreement. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 337–346, 2019.
- On the message complexity of binary byzantine agreement under crash failures. Distributed Computing, 5(4):175–186, 1992.
- Short signatures from the weil pairing. In International conference on the theory and application of cryptology and information security, pages 514–532. Springer, 2001.
- Secure and efficient asynchronous broadcast protocols. In Annual International Cryptology Conference, pages 524–541. Springer, 2001.
- Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography. Journal of Cryptology, 18(3):219–246, 2005.
- Not a coincidence: Sub-quadratic asynchronous byzantine agreement whp. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020.
- Yvo Desmedt. Society and group oriented cryptography: A new concept. In Conference on the Theory and Application of Cryptographic Techniques, pages 120–127. Springer, 1987.
- Bounds on information exchange for byzantine agreement. Journal of the ACM (JACM), 32(1):191–204, 1985.
- Early stopping in byzantine agreement. Journal of the ACM (JACM), 37(4):720–741, 1990.
- Deterministic byzantine agreement with adaptive o (n· f) communication. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1120–1146. SIAM, 2024.
- Algorand: Scaling byzantine agreements for cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles, SOSP ’17, New York, NY, USA, 2017. ACM. URL: http://doi.acm.org/10.1145/3132747.3132757.
- Message-optimal protocols for byzantine agreement. Mathematical systems theory, 26(1):41–102, 1993.
- Optimal communication complexity of authenticated byzantine agreement. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021.
- Expected linear round synchronization: The missing link for linear byzantine smr. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020.
- Victor Shoup. Practical threshold signatures. In International Conference on the Theory and Applications of Cryptographic Techniques, pages 207–220. Springer, 2000.
- Alexander Spiegelman. In search for an optimal authenticated byzantine agreement. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021.
- Strengthened fault tolerance in byzantine fault tolerant replication. In 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), pages 205–215. IEEE, 2021.