The DOI matches its Crossref record.
Asymptotically Optimal Validated Asynchronous Byzantine Agreement
Abstract
We provide a new protocol for Validated Asynchronous Byzantine Agreement in the authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine replication in the asynchronous setting. Our protocol has optimal resilience of ƒ < n/3 Byzantine failures and asymptotically optimal expected O(1) running time to reach agreement. Honest parties in our protocol send only an expected O(n2) messages where each message contains a value and a constant number of signatures. Hence our total expected communication is O(n2) words. The best previous result of Cachin et al. from 2001 solves Validated Byzantine Agreement with optimal resilience and O(1) expected time but with O(n3) expected word communication. Our work addresses an open question of Cachin et al. from 2001 and improves the expected word communication from O(n3) to asymptotically optimal O(n2).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
HotStuff: BFT Consensus with Linearity and Responsiveness
Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., & Abraham, I. (2019) · Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing · doi:10.1145/3293611.3331591 · Cited by 1,028
Self-citationDumbo: Faster Asynchronous BFT Protocols
Guo, B., Lu, Z., Tang, Q., Xu, J., & Zhang, Z. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3417262 · Cited by 278
A Survey of Blockchain Consensus Protocols
Xu, J., Wang, C., & Jia, X. (2023) · ACM Computing Surveys · doi:10.1145/3579845 · Cited by 263
Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus
Danezis, G., Kokoris-Kogias, L., Sonnino, A., & Spiegelman, A. (2022) · Proceedings of the Seventeenth European Conference on Computer Systems · doi:10.1145/3492321.3519594 · Cited by 261
Self-citationByzantine Fault-Tolerant Consensus Algorithms: A Survey
Zhong, W., Yang, C., Liang, W., Cai, J., Chen, L., Liao, J., & Xiong, N. (2023) · Electronics · doi:10.3390/electronics12183801 · Cited by 90
Metadata
- Authors
- Abraham, I., Malkhi, D., & Spiegelman, A.
- Venue
- Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
- Publisher
- ACM
- Published
- 2019-07-16
- Pages
- 337-346
- OpenAlex
- W2963873436
- Cited by
- 182
- References
- 0
- FWCI
- 14.68
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Asymptotically Optimal Validated Asynchronous Byzantine Agreement. https://app.cochat.ai/papers/10.1145/3293611.3331612
- The paper
- Abraham, I., Malkhi, D., & Spiegelman, A. (2019). Asymptotically Optimal Validated Asynchronous Byzantine Agreement. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. https://doi.org/10.1145/3293611.3331612
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.