Loading [MathJax]/extensions/MathMenu.js
How to tolerate half less one Byzantine nodes in practical distributed systems | IEEE Conference Publication | IEEE Xplore

How to tolerate half less one Byzantine nodes in practical distributed systems


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 unde...Show More

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.
Date of Conference: 18-20 October 2004
Date Added to IEEE Xplore: 08 November 2004
Print ISBN:0-7695-2239-4
Print ISSN: 1060-9857
Conference Location: Florianopolis, Brazil

References

References is not available for this document.