Utilize este identificador para referenciar este registo:
|Título:||How to Tolerate Half Less One Byzantine Nodes in Practical Distributed System|
Neves, Nuno Ferreira
|Editora:||Department of Informatics, University of Lisbon|
|Relatório da Série N.º:||di-fcul-tr-04-6|
|Resumo:||The application of dependability concepts and approaches 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 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 state machine approach (SMA), with 2f+1 replicas only. Albeit a few other papers in the literature present intrusion-tolerant services based on the SMA, 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|
|Aparece nas colecções:||FC-DI - Technical Reports|
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.