Journal
IEEE TRANSACTIONS ON COMPUTERS
Volume 68, Issue 1, Pages 139-151Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TC.2018.2860009
Keywords
Blockchain; Byzantine fault-tolerance; state machine replication; distributed systems; trusted component
Funding
- NEC Labs Europe
- Academy of Finland [309195]
- Academy of Finland (AKA) [309195, 309195] Funding Source: Academy of Finland (AKA)
Ask authors/readers for more resources
The surging interest in blockchain technology has revitalized the search for effective Byzantine consensus schemes. In particular, the blockchain community has been looking for ways to effectively integrate traditional Byzantine fault-tolerant (BFT) protocols into a blockchain consensus layer allowing various financial institutions to securely agree on the order of transactions. However, existing BFT protocols can only scale to tens of nodes due to their O(n(2)) message complexity. In this paper, we propose FastBFT, a fast and scalable BFT protocol. At the heart of FastBFT is a novel message aggregation technique that combines hardware-based trusted execution environments (TEEs) with lightweight secret sharing. Combining this technique with several other optimizations (i.e., optimistic execution, tree topology and failure detection), FastBFT achieves low latency and high throughput even for large scale networks. Via systematic analysis and experiments, we demonstrate that FastBFT has better scalability and performance than previous BFT protocols.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available