Byzantine Consensus with Unknown Participants
Byzantine Consensus with Unknown Participants
复制标题
DOI：
10.1007/978-3-540-92221-6_4
复制
发表时间：
2008-12
期刊：
影响因子：
--
通讯作者：
E. Alchieri;A. Bessani;J. Fraga;F. Greve
中科院分区：
文献类型：
--
作者：
E. Alchieri;A. Bessani;J. Fraga;F. Greve
共识是一个基本的构建块，用于解决出现在可靠的分布式系统上的许多实际问题。尽管共识在经典网络的背景下被广泛研究，但很少有研究在以未知网络为特征的动态和自组织系统的背景下解决它。虽然在经典网络中，参与者的集合是静态的并且是已知的，但在未知网络的场景中，参与者的集合和数量是先前未知的。本文进一步研究了未知参与者的拜占庭容错共识问题，即BFT-CUP。这个新问题旨在解决未知网络中的共识，并要求系统中的参与者可能会有恶意行为。本文提出了一种不需要数字签名的BFT-CUP解决方案。该算法被证明是最佳的同步性和知识的系统中的参与者之间的连接。
Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being widely studied in the context of classical networks, few studies have been conducted in order to solve it in the context of dynamic and self-organizing systems characterized by unknown networks. While in a classical network the set of participants is static and known, in a scenario of unknown networks, the set and number of participants are previously unknown. This work goes one step further and studies the problem ofByzantine Fault-Tolerant Consensus with Unknown Participants, namely BFT-CUP. This new problem aims at solving consensus in unknown networks with the additional requirement that participants in the system can behave maliciously. This paper presents a solution for BFT-CUP that does not require digital signatures. The algorithms are shown to be optimal in terms of synchrony and knowledge connectivity among participants in the system.