中国密码学会2022年密码算法学术会议

This talk will dissect the efficiency bottlenecks of the prior art (e.g., HoneyBadger BFT in CCS’16 and Dumbo BFT in CCS’20) and then present Speeding-Dumbo (NDSS’22), our very recent design that can reduce the expected round complexity of asynchronous BFT consensus to about a dozen of rounds (in the worst case) or fewer (in other better cases). The reduced round complexity together with other optimizations can gain great performance improvement in the real-world WAN environment, e.g., realize a basic confirmation latency that is only about half of Dumbo BFT (CCS’20).