The HoneyBadger of BFT Protocols
Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, Dawn Song
Abstract
This paper introduces HoneyBadgerBFT, a novel asynchronous Byzantine Fault Tolerance (BFT) protocol designed for high throughput in permissionless blockchain settings. Unlike many traditional BFT protocols that rely on strong synchrony assumptions or suffer from low scalability, HoneyBadgerBFT employs techniques like batched cryptographic primitives and a form of asynchronous multi-signatures to achieve its goals. It processes transactions in batches, significantly increasing efficiency. The protocol is designed to be robust against network delays and partitions, characteristic of real-world decentralized networks. The authors demonstrate that HoneyBadgerBFT can achieve high performance, outperforming existing BFT protocols in terms of throughput while maintaining provable security under realistic network assumptions. This work contributes to the development of scalable and resilient consensus mechanisms for public blockchains.
Key Findings
- 1HoneyBadgerBFT is an asynchronous BFT protocol designed for high throughput in permissionless blockchains.
- 2It utilizes batched cryptography and asynchronous multi-signatures to improve efficiency and resilience.
- 3The protocol is robust against network delays and partitions, common in decentralized environments.
- 4HoneyBadgerBFT demonstrates significant performance improvements over existing BFT protocols in terms of transaction throughput.
Topics
Citation
BibTeX
@misc{thehoneybadger2016,
title = {The HoneyBadger of BFT Protocols},
author = {Andrew Miller and Yu Xia and Kyle Croman and Elaine Shi and Dawn Song},
year = {2016},
howpublished = {\url{https://eprint.iacr.org/2016/199}},
}Knowledge Explorer
Explore Related Concepts
See how The HoneyBadger of BFT Protocols connects to glossary terms, books, and other research in the Knowledge Graph.