1. Flexible Byzantine Fault Tolerance 2019 BFT CCS
    Dahlia Malkhi, Kartik Nayak, and Ling Ren
    [View PDF on arxiv.org]
    [Show BibTex Citation]

    @article{Malkhi_2019,
    title={Flexible Byzantine Fault Tolerance},
    ISBN={9781450367479},
    url={http://dx.doi.org/10.1145/3319535.3354225},
    DOI={10.1145/3319535.3354225},
    journal={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19},
    publisher={ACM Press},
    author={Malkhi, Dahlia and Nayak, Kartik and Ren, Ling},
    year={2019}
    }

This paper introduces Flexible BFT, a new approach for BFT consensus solution design revolving around two pillars, stronger resilience and diversity. The first pillar, stronger resilience, involves a new fault model called alive-but-corrupt faults. Alive-but-corrupt replicas may arbitrarily deviate from the protocol in an attempt to break safety of the protocol. However, if they cannot break safety, they will not try to prevent liveness of the protocol. Combining alive-but-corrupt faults into the model, Flexible BFT is resilient to higher corruption levels than possible in a pure Byzantine fault model. The second pillar, diversity, designs consensus solutions whose protocol transcript is used to draw different commit decisions under diverse beliefs. With this separation, the same Flexible BFT solution supports synchronous and asynchronous beliefs, as well as varying resilience threshold combinations of Byzantine and alive-but-corrupt faults. At a technical level, Flexible BFT achieves the above results using two new ideas. First, it introduces a synchronous BFT protocol in which only the commit step requires to know the network delay bound and thus replicas execute the protocol without any synchrony assumption. Second, it introduces a notion called Flexible Byzantine Quorums by dissecting the roles of different quorums in existing consensus protocols.

  1.