Low complexity Byzantine-resilient consensus

作     者：Correia, M Neves, NF Lung, LC Veríssimo, P 

作者机构：Univ Lisbon Fac Ciencias P-1749016 Lisbon Portugal Pontificia Univ Catolica Parana BR-80215901 Prado Velho Brazil 

出 版 物：《DISTRIBUTED COMPUTING》 (分布式计算)

年 卷 期：2005年第17卷第3期

页      面：237-249页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：  (POSI/CHS/39815/2001) 

主　　题：Byzantine fault tolerance intrusion tolerance distributed systems models distributed algorithms consensus 

摘      要：The application of the tolerance paradigm to security - intrusion tolerance - has been raising a reasonable amount of attention in the dependability and security communities. In this paper we present a novel approach to intrusion tolerance. The idea is to use privileged components - generically designated by wormholes - to support the execution of intrusion-tolerant protocols, often called Byzantine-resilient in the literature. The paper introduces the design of wormhole-aware intrusion-tolerant protocols using a classical distributed systems problem: consensus. The system where the consensus protocol runs is mostly asynchronous and can fail in an arbitrary way, except for the wormhole, which is secure and synchronous. Using the wormhole to execute a few critical steps, the protocol manages to have a low time complexity: in the best case, it runs in two rounds, even if some processes are malicious. The protocol also shows how often theoretical partial synchrony assumptions can be substantiated in practical distributed systems. The paper shows the significance of the TTCB as an engineering paradigm, since the protocol manages to be simple when compared with other protocols in the literature.