BEAT: Asynchronous BFT made practical

Sisi Duan, Michael K. Reiter, Haibin Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

152 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationCCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
PublisherAssociation for Computing Machinery
Pages2028-2041
Number of pages14
ISBN (Electronic)9781450356930
DOIs
Publication statusPublished - 15 Oct 2018
Externally publishedYes
Event25th ACM Conference on Computer and Communications Security, CCS 2018 - Toronto, Canada
Duration: 15 Oct 2018 → …

Publication series

NameProceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)1543-7221

Conference

Conference25th ACM Conference on Computer and Communications Security, CCS 2018
Country/TerritoryCanada
CityToronto
Period15/10/18 → …

Keywords

  • Asynchronous BFT
  • BFT
  • Blockchain
  • Byzantine fault tolerance
  • Robustness
  • Threshold cryptography

Fingerprint

Dive into the research topics of 'BEAT: Asynchronous BFT made practical'. Together they form a unique fingerprint.

Cite this