Paper 2023/1660 Original: eprint.iacr.org/2023/1660 ↗
FaBFT: Flexible Asynchronous BFT Protocol Using DAG
Abstract
The Byzantine Fault Tolerance (BFT) protocol is a long-standing topic. Recently, a lot of efforts have been made in the research of asynchronous BFT. However, the existing solutions cannot adapt well to the flexible network environment, and suffer from problems such as high communication complexity or long latency. To improve the efficiency of BFT consensus in flexible networks, we propose FaBFT. FaBFT's clients can make their own assumptions about the network conditions, and make the most of their networks based on different network assumptions. We also use the BlockDAG structure and an efficient consistent broadcast protocol to improve the concurrency and reduce the number of steps in FaBFT. The comparison with other asynchronous BFT protocols shows that FaBFT has lower complexity and cancels the dependency on the view change. We prove that FaBFT is an atomic broadcast protocol in the flexible networks.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-10-27: last updated
- 2023-10-26: published
- Short URL
- https://ia.cr/2023/1660
- License
- https://creativecommons.org/licenses/by-nc/4.0/
BibTeX
@misc{cryptoeprint:2023/1660,
author = {Yu Song and Yu Long and Xian Xu and Dawu Gu},
title = {FaBFT: Flexible Asynchronous BFT Protocol Using DAG},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1660},
year = {2023},
url = {https://eprint.iacr.org/2023/1660}
}