The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Dumbo: Faster Asynchronous BFT Protocols
Abstract
HoneyBadgerBFT, proposed by Miller et al. [34] as the first practical asynchronous atomic broadcast protocol, demonstrated impressive performance. The core of HoneyBadgerBFT (HB-BFT) is to achieve batching consensus using asynchronous common subset protocol (ACS) of Ben-Or et al., constituted with n reliable broadcast protocol (RBC) to have each node propose its input, followed by n asynchronous binary agreement protocol (ABA) to make a decision for each proposed value (n is the total number of nodes).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
The Honey Badger of BFT Protocols
Miller, A., Xia, Y., Croman, K., Shi, E., & Song, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978399 · Cited by 810
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
Ben-Or, M. (1983) · Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 · doi:10.1145/800221.806707 · Cited by 590
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
State Machine Replication for the Masses with BFT-SMART
Bessani, A., Sousa, J., & Alchieri, E. E. P. (2014) · 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks · doi:10.1109/dsn.2014.43 · Cited by 567
Asynchronous Byzantine agreement protocols
Bracha, G. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90054-x · Cited by 440
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
Cachin, C., Kursawe, K., & Shoup, V. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0318-0 · Cited by 437
An asynchronous [(n - 1)/3]-resilient consensus protocol
Bracha, G. (1984) · Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84 · doi:10.1145/800222.806743 · Cited by 293
RBFT: Redundant Byzantine Fault Tolerance
Aublin, P.-L., Mokhtar, S. B., & Quema, V. (2013) · 2013 IEEE 33rd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2013.53 · Cited by 279
BEAT: Asynchronous BFT Made Practical
Duan, S., Reiter, M. K., & Zhang, H. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243812 · Cited by 198
Asynchronous secure computations with optimal resilience (extended abstract)
Ben-Or, M., Kelmer, B., & Rabin, T. (1994) · Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 · doi:10.1145/197917.198088 · Cited by 195
Prime: Byzantine Replication under Attack
Amir, Y., Coan, B., Kirsch, J., & Lane, J. (2011) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2010.70 · Cited by 192
Secure INtrusion-Tolerant Replication on the Internet
Cachin, C., & Poritz, J. A. (2003) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2002.1028897 · Cited by 187
Asymptotically Optimal Validated Asynchronous Byzantine Agreement
Abraham, I., Malkhi, D., & Spiegelman, A. (2019) · Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing · doi:10.1145/3293611.3331612 · Cited by 182
Spin One's Wheels? Byzantine Fault Tolerance with a Spinning Primary
Veronese, G. S., Correia, M., Bessani, A. N., & Lung, L. C. (2009) · 2009 28th IEEE International Symposium on Reliable Distributed Systems · doi:10.1109/srds.2009.36 · Cited by 164
An efficient algorithm for byzantine agreement without authentication
Dolev, D., Fischer, M. J., Fowler, R., Lynch, N., & Strong, H. R. (1982) · Information and Control · doi:10.1016/s0019-9958(82)90776-8 · Cited by 149
SoK: A Consensus Taxonomy in the Blockchain Era
Garay, J. A., & Kiayias, A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-40186-3_13 · Cited by 136
Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
Lu, Y., Lu, Z., Tang, Q., & Wang, G. (2020) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3382734.3405707 · Cited by 130
Self-citationSignature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
Mostéfaoui, A., Moumen, H., & Raynal, M. (2014) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2611462.2611468 · Cited by 121
Abraham, I., Devadas, S., Dolev, D., Nayak, K., & Ren, L. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-32101-7_20 · Cited by 95
Mostéfaoui, A., Moumen, H., & Raynal, M. (2015) · Journal of the ACM · doi:10.1145/2785953 · Cited by 93
Cited by
A Survey of Blockchain Consensus Protocols
Xu, J., Wang, C., & Jia, X. (2023) · ACM Computing Surveys · doi:10.1145/3579845 · Cited by 263
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
- Guo, B., Lu, Z., Tang, Q., Xu, J., & Zhang, Z.
- Venue
- Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2020-10-30
- Volume
- 2020
- Pages
- 803-818
- OpenAlex
- W3046288907
- Cited by
- 278
- References
- 24
- FWCI
- 26.72
- 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
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.