Paper 2022/1709 Original: eprint.iacr.org/2022/1709 ↗
Dory: Faster Asynchronous BFT with Reduced Communication for Permissioned Blockchains
Abstract
Asynchronous Byzantine fault-tolerance (BFT) protocols (e.g., HoneyBadger and Dumbo family protocols) have received increasing attention as the consensus mechanism of permissioned blockchains, given their particular robustness against timing and performance attacks. However, there is a substantial performance gap before they can be applied in real systems. In this paper, we identify and address two critical issues, and design Dory, an asynchronous BFT consensus protocol with improved efficiency and lower communication compared to the state-of-the-art protocol, sDumbo. At the core of our approach are two new building blocks reducing the communication cost and a novel framework utilizing transactions with quadratic message complexity. We have implemented Dory and sDumbo in a new Golang library. Via a deployment using up to 151 participants on Amazon EC2, we show that Dory consistently outperforms sDumbo during both failure and failure-free scenarios. For instance, Dory has up to 5x the throughput of sDumbo in the failure-free scenario.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-12-20: last updated
- 2022-12-09: published
- Short URL
- https://ia.cr/2022/1709
- License
- https://creativecommons.org/licenses/by-nc/4.0/
BibTeX
@misc{cryptoeprint:2022/1709,
author = {Zongyang Zhang and You Zhou and Sisi Duan and Haibin Zhang and Bin Hu and Licheng Wang and Jianwei Liu},
title = {Dory: Faster Asynchronous BFT with Reduced Communication for Permissioned Blockchains},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/1709},
year = {2022},
url = {https://eprint.iacr.org/2022/1709}
}