“Efficient Byzantine Fault-Tolerance”

From Navigators

(Difference between revisions)
Jump to: navigation, search
(Created page with "{{Publication |type=article |document=Document for Publication-Veronese13FTolerance.pdf |title=Efficient Byzantine Fault-Tolerance |author=Giuliana Santos Veronese,Miguel Correia...")
 
Line 3: Line 3:
|document=Document for Publication-Veronese13FTolerance.pdf
|document=Document for Publication-Veronese13FTolerance.pdf
|title=Efficient Byzantine Fault-Tolerance
|title=Efficient Byzantine Fault-Tolerance
-
|author=Giuliana Santos Veronese,Miguel Correia;Alysson Bessani;Lau Cheuk Lung,Paulo Verissimo
+
|author=Giuliana Santos Veronese, Miguel Correia, Alysson Bessani, Lau Cheuk Lung, Paulo Verissimo
|Project=TCLOUDS,REGENESYS
|Project=TCLOUDS,REGENESYS
|month=jan
|month=jan

Latest revision as of 15:10, 26 February 2013

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

IEEE Transactions on Computers, vol. 62, no. 1, pp. 16–30, Jan. 2013.

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.

Download paper

Download Efficient Byzantine Fault-Tolerance

Export citation

BibTeX

Project(s): TCLOUDS, REGENESYS

Missing ResearchLine

Personal tools
Navigators toolbox