Paper 2022/1433
BG: A Modular Treatment of BFT Consensus
Abstract
We provide an expressive framework that allows analyzing and generating provably secure, state-of-the-art Byzantine fault-tolerant (BFT) protocols. Our framework is hierarchical, including three layers. The top layer is used to model the message pattern and abstract key functions on which BFT algorithms can be built. The intermediate layer provides the core functions with high-level properties sufficient to prove the security of the top-layer algorithms. The bottom layer carefully defines predicates according to which we offer operational realizations for the core functions. All three layers in our framework are extensible and enable innovation. One may modify or extend any layer to theoretically cover all BFT protocols, known and unknown. Indeed, unlike prior BFT frameworks, our framework can analyze and recast BFT protocols in an exceedingly fine-grained manner. More importantly, our framework can readily generate new BFT protocols by simply enumerating the parameters in the framework. In this paper, we show that the framework allows us to fully specify and formally prove the security for 23 BFT protocols, including protocols matching HotStuff, Fast-HotStuff, Jolteon, and Marlin, and among these protocols, seven new protocols outperforming existing ones or achieving meaningful trade-offs among various performance metrics.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Minor revision. TIFS
- DOI
- 10.1109/TIFS.2023.3318943
- Keywords
- BFTByzantine fault tolerancemodular treatmentconsensustheoryBGdominant predicate
- Contact author(s)
-
suixiao @ mail sdu edu cn
duansisi @ tsinghua edu cn
haibin @ bit edu cn - History
- 2024-07-12: last of 2 revisions
- 2022-10-21: received
- See all versions
- Short URL
- https://ia.cr/2022/1433
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1433,
author = {Xiao Sui and Sisi Duan and Haibin Zhang},
title = {{BG}: A Modular Treatment of {BFT} Consensus},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/1433},
year = {2022},
doi = {10.1109/TIFS.2023.3318943},
url = {https://eprint.iacr.org/2022/1433}
}