Efficient byzantine fault-tolerance

Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, Paulo Verissimo

Research output: Contribution to journalArticlepeer-review

122 Scopus citations

Abstract

We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics. First, they require only 2f+1 replicas, instead of the usual 3f+1. Second, the trusted service in which this reduction of replicas is based is quite simple, making a verified implementation straightforward (and even feasible using commercial trusted hardware). Third, in nice executions the two algorithms run in the minimum number of communication steps for nonspeculative and speculative algorithms, respectively, four and three steps. Besides the obvious benefits in terms of cost, resilience and management complexity—fewer replicas to tolerate a certain number of faults—our algorithms are simpler than previous ones, being closer to crash fault-tolerant replication algorithms. The performance evaluation shows that, even with the trusted component access overhead, they can have better throughput than Castro and Liskov's PBFT, and better latency in networks with nonnegligible communication delays. © 2012 IEEE.
Original languageEnglish (US)
Pages (from-to)16-30
Number of pages15
JournalIEEE Transactions on Computers
Volume62
Issue number1
DOIs
StatePublished - Jan 1 2013
Externally publishedYes

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Software

Fingerprint Dive into the research topics of 'Efficient byzantine fault-tolerance'. Together they form a unique fingerprint.

Cite this