The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
BEAT: Asynchronous BFT Made Practical
Abstract
We present BEAT, a set of practical Byzantine fault-tolerant (BFT) protocols for completely asynchronous environments. BEAT is flexible, versatile, and extensible, consisting of five asynchronous BFT protocols that are designed to meet different goals (e.g., different performance metrics, different application scenarios). Due to modularity in its design, features of these protocols can be mixed to achieve even more meaningful trade-offs between functionality and performance for various applications. Through a 92-instance, five-continent deployment of BEAT on Amazon EC2, we show that BEAT is efficient: roughly, all our BEAT instances significantly outperform, in terms of both latency and throughput, HoneyBadgerBFT, the most efficient asynchronous BFT known.
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
Cites
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
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
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Research works printed but not linked: 80
- 10.1145/1095810.1095817 · DOI
- 10.1007/s13389-013-0057-3 · DOI · Paper page
- 10.1109/TDSC.2010.70 · DOI · Paper page
- 10.1007/978-3-319-14472-6_6 · doi:10.1007/978-3-319-14472-6_6
- 10.1145/3190508.3190538 · DOI · Paper page
- 10.1145/2658994 · DOI
- 10.1109/ICDCS.2013.53 · DOI · Paper page
- J. Baek and Y. Zheng . Simple and efficient threshold cryptosystem from the gap Diffie-Hellman group . GLOBECOM '03 , pp. 1491 -- 1495 , 2003 . J. Baek and Y. Zheng. Simple and efficient threshold cryptosystem from the gap Diffie-Hellman group. GLOBECOM '03, pp. 1491--1495, 2003.
- 10.1109/MCSE.2010.118 · DOI · Paper page
- 10.5555/646761.706031 · doi:10.5555/646761.706031
- 10.1145/168588.168596 · DOI · Paper page
- 10.1145/197917.198088 · DOI · Paper page
- 10.1145/1357010.1352610 · DOI
- 10.1109/DSN.2014.43 · DOI · Paper page
- 10.5555/648120.747061 · doi:10.5555/648120.747061
- 10.1007/11605805_15 · doi:10.1007/11605805_15
- 10.1016/0890-5401(87)90054-X · DOI · Paper page
- M. Burrows . The Chubby lock service for loosely-coupled distributed systems . OSDI , 2006 . M. Burrows. The Chubby lock service for loosely-coupled distributed systems. OSDI, 2006.
- 10.5555/646766.704283 · doi:10.5555/646766.704283
- 10.1007/s00145-005-0318-0 · DOI · Paper page
- 10.5555/647883.738262 · doi:10.5555/647883.738262
- 10.1109/RELDIS.2005.9 · DOI
- 10.1109/DSN.2006.56 · DOI
- 10.1145/2043556.2043571 · DOI · Paper page
- A. Clement , E. Wong , L. Alvisi , M. Dahlin , and M. Marchetti . Making Byzantine fault tolerant systems tolerate Byzantine faults . NSDI 2009 . A. Clement, E. Wong, L. Alvisi, M. Dahlin, and M. Marchetti. Making Byzantine fault tolerant systems tolerate Byzantine faults. NSDI 2009.
- J. Corbett : Google's globally-distributed database . OSDI , 2012 . J. Corbett et al. Spanner: Google's globally-distributed database. OSDI, 2012.
- J. Cowling HQ replication : A hybrid quorum protocol for Byzantine fault tolerance . OSDI 2006 . J. Cowling et al. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. OSDI 2006.
- 10.1145/2508859.2516750 · doi:10.1145/2508859.2516750
- 10.1007/978-3-319-14472-6_7 · DOI
- 10.1109/TDSC.2014.2312331 · DOI
- 10.1109/DSN.2017.64 · DOI
- 10.1109/SRDS.2016.031 · DOI
- 10.1145/42282.42283 · DOI · Paper page
- 10.1145/3149.214121 · DOI · Paper page
- 10.1007/s00145-006-0347-3 · DOI · Paper page
- 10.1109/ICDCS.1989.37934 · doi:10.1109/icdcs.1989.37934
- 10.5555/1009382.1009729 · doi:10.5555/1009382.1009729
- 10.1109/MSST.2010.5496983 · doi:10.1109/msst.2010.5496983
- J. L. Hafner . Weaver codes : Highly fault tolerant erasure codes for storage systems . USENIX FAST , 2005 . J. L. Hafner. Weaver codes: Highly fault tolerant erasure codes for storage systems. USENIX FAST, 2005.
- 10.1109/DSN.2006.40 · DOI
- 10.1145/1281100.1281122 · DOI
- 10.1145/1294261.1294269 · DOI
- 10.1145/114005.102808 · doi:10.1145/114005.102808
- 10.1145/78969.78972 · DOI · Paper page
- 10.5555/850929.851942 · doi:10.5555/850929.851942
- Y. Hu , H. Chen , P. Lee , and Y. Tang . NCCloud: Applying network coding for the storage repair in a Cloud-of-Clouds . USENIX FAST , 2012 . Y. Hu, H. Chen, P. Lee, and Y. Tang. NCCloud: Applying network coding for the storage repair in a Cloud-of-Clouds. USENIX FAST, 2012.
- 10.1145/2435204.2435207 · doi:10.1145/2435204.2435207
- C. Huang , H. Simitci , Y. Xu , A. Ogus , B. Calder , P. Gopalan , J. Li , and S. Yekhanin . Erasure coding in Windows Azure Storage . USENIX ATC'12 , 2012 . C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin. Erasure coding in Windows Azure Storage. USENIX ATC'12, 2012.
- P. Hunt , M. Konar , F. P. Junqueira , and B. Reed . ZooKeeper: Wait-free coordination for Internet-scale systems . USENIX ATC 2010 . P. Hunt, M. Konar, F. P. Junqueira, and B. Reed. ZooKeeper: Wait-free coordination for Internet-scale systems. USENIX ATC 2010.
- IBM Watson Health Announces Collaboration to Study the Use of Blockchain Technology for Secure Exchange of Healthcare Data. https://www-03.ibm.com/press/us/en/pressrelease/51394.wss IBM Watson Health Announces Collaboration to Study the Use of Blockchain Technology for Secure Exchange of Healthcare Data. https://www-03.ibm.com/press/us/en/pressrelease/51394.wss
- IBM Announces Major Blockchain Solution to Speed Global Payments. https://www-03.ibm.com/press/us/en/pressrelease/53290.wss IBM Announces Major Blockchain Solution to Speed Global Payments. https://www-03.ibm.com/press/us/en/pressrelease/53290.wss
- A. Kate , Y. Huang , and I. Goldberg . Distributed key generation in the wild. IACR Cryptology ePrint Archive 2012: 377 ( 2012 ). A. Kate, Y. Huang, and I. Goldberg. Distributed key generation in the wild. IACR Cryptology ePrint Archive 2012: 377 (2012).
- O. Khan , R. Burns , J. Plank , W. Pierce , and C. Huang . Rethinking erasure codes for cloud file systems: Minimizing I/O for recovery and degraded reads . USENIX FAST , 2012 . O. Khan, R. Burns, J. Plank, W. Pierce, and C. Huang. Rethinking erasure codes for cloud file systems: Minimizing I/O for recovery and degraded reads. USENIX FAST, 2012.
- 10.1145/1294261.1294267 · DOI · Paper page
- 10.1145/164051.164075 · DOI
- 10.1145/359863.359878 · doi:10.1145/359863.359878
- 10.1145/2993.2994 · DOI · Paper page
- 10.1007/BF01786227 · DOI
- 10.1007/BF01786227 · DOI
- 10.1109/ICDCS.2005.56 · doi:10.1109/icdcs.2005.56
- F. J. MacWilliams and N. J. A. Sloane . The Theory of Error Correcting Codes . Amsterdam , North-Holland , 1977 . F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. Amsterdam, North-Holland, 1977.
- 10.1145/2976749.2978399 · DOI · Paper page
- 10.6028/jres.120.002 · doi:10.6028/jres.120.002
- 10.1145/2611462.2611468 · DOI
- J. Plank , K. Greenan , and E. Miller . Screaming fast Galois field arithmetic using Intel SIMD instructions . FAST 2013 , 2013 . Latest version: http://lab.jerasure.org/jerasure/gf-complete J. Plank, K. Greenan, and E. Miller. Screaming fast Galois field arithmetic using Intel SIMD instructions. FAST 2013, 2013. Latest version: http://lab.jerasure.org/jerasure/gf-complete
- 10.1109/NCA.2006.43 · doi:10.1109/nca.2006.43
- 10.1145/62044.62050 · DOI · Paper page
- 10.1137/0108018 · DOI · Paper page
- 10.1145/177492.177745 · DOI
- 10.14778/2535573.2488339 · DOI · Paper page
- 10.1145/98163.98167 · DOI · Paper page
- 10.5555/646761.706150 · doi:10.5555/646761.706150
- 10.5555/1756169.1756190 · doi:10.5555/1756169.1756190
- V. Shoup and R. Gennaro . Securing threshold cryptosystems against chosen ciphertext attack . EUROCRYPT '98 . V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. EUROCRYPT '98.
- 10.1109/DSN.2018.00018 · DOI · Paper page
- H. Turki F. Salgado J. M. Camacho. HoneyLedgerBFT: Enabling Byzantine fault tolerance for the Hyperledger platform. Available: https://www.semanticscholar.org/ H. Turki F. Salgado J. M. Camacho. HoneyLedgerBFT: Enabling Byzantine fault tolerance for the Hyperledger platform. Available: https://www.semanticscholar.org/
- 10.1007/978-3-642-35476-2_24 · DOI
- 10.1109/SRDS.2009.36 · DOI · Paper page
- Walmart JD.com IBM and Tsinghua University Launch a Blockchain Food Safety Alliance in China. https://www-03.ibm.com/press/us/en/pressrelease/53487.wss Walmart JD.com IBM and Tsinghua University Launch a Blockchain Food Safety Alliance in China. https://www-03.ibm.com/press/us/en/pressrelease/53487.wss
- 10.1145/1085126.1085127 · DOI
Cited by
A Survey of Distributed Consensus Protocols for Blockchain Networks
Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2969706 · Cited by 841
SBFT: A Scalable and Decentralized Trust Infrastructure
Golan Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.-A., Tamir, O., & Tomescu, A. (2019) · 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2019.00063 · Cited by 362
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
Wang, G., Shi, Z. J., Nixon, M., & Han, S. (2019) · Proceedings of the 1st ACM Conference on Advances in Financial Technologies · doi:10.1145/3318041.3355457 · Cited by 270
A Survey of Blockchain Consensus Protocols
Xu, J., Wang, C., & Jia, X. (2023) · ACM Computing Surveys · doi:10.1145/3579845 · Cited by 263
Metadata
- Authors
- Duan, S., Reiter, M. K., & Zhang, H.
- Venue
- Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2018-10-15
- Pages
- 2028-2041
- OpenAlex
- W2890933237
- Cited by
- 198
- References
- 3
- FWCI
- 14.62
- 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: BEAT: Asynchronous BFT Made Practical. https://app.cochat.ai/papers/10.1145/3243734.3243812
- The paper
- Duan, S., Reiter, M. K., & Zhang, H. (2018). BEAT: Asynchronous BFT Made Practical. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/3243734.3243812
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.