How to Tolerate Half Less One Byzantine Nodes in Practical Distributed Systems

Authors:
Miguel Correia;Nuno Ferreira Neves;Paulo Verissimo
Affiliations:
Faculdade de Ciências da Universidade de Lisboa, Portugal;Faculdade de Ciências da Universidade de Lisboa, Portugal;Faculdade de Ciências da Universidade de Lisboa, Portugal
Venue:
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Year:
2004

Citing 0
Cited 9

Automated Rule-Based Diagnosis through a Distributed Monitor System

IEEE Transactions on Dependable and Secure Computing
A methodology to design arbitrary failure detectors for distributed protocols

Journal of Systems Architecture: the EUROMICRO Journal
Reducing the costs of large-scale BFT replication

LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Asynchronous Byzantine consensus with 2f+1 processes

Proceedings of the 2010 ACM Symposium on Applied Computing
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency

Proceedings of the sixth conference on Computer systems
CheapBFT: resource-efficient byzantine fault tolerance

Proceedings of the 7th ACM european conference on Computer Systems
Iwazaru: the byzantine sequencer

ARCS'13 Proceedings of the 26th international conference on Architecture of Computing Systems
A virtual grouping based fault-tolerant scheme for autonomous networks

Engineering Applications of Artificial Intelligence
Scalable and leaderless Byzantine consensus in cloud computing environments

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The application of dependability concepts and techniques to the design of secure distributed systems is raising a considerable amount of interest in both communities under the designation of intrusion tolerance. However, practical intrusion-tolerant replicated systems based on the state machine approach (SMA) can handle at most f Byzantine components out of a total of n = 3f + 1, which is the maximum resilience in asynchronous systems. This paper extends the normal asynchronous system with a special distributed oracle called TTCB. Using this extended system we manage to implement an intrusion-tolerant service based on the SMA with only 2f + 1 replicas. Albeit a few other papers in the literature present intrusion-tolerant services with this approach, this is the first time the number of replicas is reduced from 3f + 1 to 2f + 1. Another interesting characteristic of the described service is a low time complexity.