“BFT-TO: Intrusion Tolerance with”

From Navigators

Revision as of 14:21, 19 June 2013 by Jrico (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Miguel Correia, Nuno Ferreira Neves, Paulo Verissimo

The Computer Journal, vol. 56, no. 6, pp. 693–715, Jun. 2013.

Abstract: State machine replication (SMR) is a generic technique for implementing fault-tolerant distributed services by replicating them in sets of servers. There have been several proposals for using SMR to tolerate arbitrary or Byzantine faults, including intrusions. However, most of these systems can tolerate at most f faulty servers out of a total of 3f + 1. We show that it is possible to implement a Byzantine state machine replication algorithm with only 2f + 1 replicas by extending the system with a simple trusted distributed component. Several performance metrics show that our algorithm, BFT-TO, fares well in comparison with others in the literature. Furthermore, BFT-TO is not vulnerable to some recently-presented performance attacks that affect alternative approaches.

Download paper

Download BFT-TO: Intrusion Tolerance with

Export citation


Project(s): Project:MASSIF, Project:TCLOUDS, Project:RC-Clouds

Research line(s): Fault and Intrusion Tolerance in Open Distributed Systems (FIT)

Personal tools
Navigators toolbox