Scalable Byzantine Consensus via Hardware-assisted Secret Sharing

Research output: Contribution to journalArticle


Research units

  • University of Helsinki
  • NEC Corporation


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(n2) 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.


Original languageEnglish
Pages (from-to)139-151
JournalIEEE Transactions on Computers
Issue number1
Publication statusPublished - 1 Jan 2019
MoE publication typeA1 Journal article-refereed

    Research areas

  • Bitcoin, Blockchain, Byzantine fault-tolerance, distributed systems, Fault tolerance, Fault tolerant systems, Protocols, Silicon, state machine replication, trusted component

Download statistics

No data available

ID: 27133421