1. BEAT: Asynchronous BFT Made Practical 2018 CCS Consensus
    Sisi Duan, Michael K. Reiter, and Haibin Zhang
    [View PDF on csee.umbc.edu]
    [Show BibTex Citation]

    @inproceedings{10.1145/3243734.3243812,
    author = {Duan, Sisi and Reiter, Michael K. and Zhang, Haibin},
    title = {BEAT: Asynchronous BFT Made Practical},
    year = {2018},
    isbn = {9781450356930},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    url = {https://doi.org/10.1145/3243734.3243812},
    doi = {10.1145/3243734.3243812},
    booktitle = {Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security},
    pages = {2028–2041},
    numpages = {14},
    keywords = {BFT, threshold cryptography, blockchain, byzantine fault tolerance, robustness, asynchronous BFT},
    location = {Toronto, Canada},
    series = {CCS ’18}
    }

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.

  1.