Paper 2022/1709

Dory: Asynchronous BFT with Reduced Communication and Improved Efficiency

You Zhou, Beihang University
Zongyang Zhang, Beihang University
Haibin Zhang, Beijing Institute of Technology
Sisi Duan, Tsinghua University
Bin Hu, Beihang University
Licheng Wang, Beijing Institute of Technology
Jianwei Liu, Beihang University

Asynchronous Byzantine fault-tolerant (BFT) protocols have received increasing attention, as they are particularly robust against timing and performance attacks. This paper designs and implements Dory, an asynchronous BFT protocol with reduced communication and improved efficiency compared to existing systems. In particular, Dory reduces the communication both asymptotically and concretely and gains in improved performance. To achieve the goal, we have devised a novel primitive called asynchronous vector data dissemination, and we have developed the idea of supplemental consensus originally used in DispersedLedger for higher throughput and fairness without using threshold encryption. We have implemented and deployed our system using up to 151 replicas on Amazon EC2. We demonstrate that even without using the technique of separating data transmission from agreement, Dory has up to 5x the throughput of Speeding Dumbo (sDumbo), while lowering the communication cost for different batch sizes.

Available format(s)
Cryptographic protocols
Publication info
Byzantine fault tolerance BFT consensus asynchronous BFT
Contact author(s)
youzhou @ buaa edu cn
zongyangzhang @ buaa edu cn
haibin @ bit edu cn
duansisi @ tsinghua edu cn
hubin0205 @ buaa edu cn
lcwang @ bit edu cn
liujianwei @ buaa edu cn
2022-12-10: approved
2022-12-09: received
See all versions
Short URL
Creative Commons Attribution-NonCommercial


      author = {You Zhou and Zongyang Zhang and Haibin Zhang and Sisi Duan and Bin Hu and Licheng Wang and Jianwei Liu},
      title = {Dory: Asynchronous BFT with Reduced Communication and Improved Efficiency},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1709},
      year = {2022},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.