Byzantine Agreement with Unknown Participants and Failures
Byzantine Agreement with Unknown Participants and Failures
复制标题
与未知参与者的拜占庭协议和失败
DOI：
10.1109/ipdps49936.2021.00104
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Roger Wattenhofer
中科院分区：
文献类型：
--
作者：
Pankaj Khanchandani;Roger Wattenhofer
一组相互不信任的参与者想要就共同的观点达成一致，必须解决拜占庭协议问题的一个实例。这些问题已在文献中得到广泛研究。然而，大多数现有的解决方案假设参与者知道n -系统中参与者的总数-和f -拜占庭参与者数量的上限。在本文中，我们表明，即使参与者不知道（可能改变）n和f的值，大多数基本协议问题可以解决，而不影响弹性。具体来说，我们考虑一个同步系统中的参与者有唯一的，但不一定是连续的标识符，并给出拜占庭协议算法的可靠广播，近似协议，转子协调器，提前终止共识和总订购在静态和动态系统中，所有的最佳弹性n>3f。此外，我们表明，一些同步是必要的，因为在半同步或异步系统中，如果参与者不知道n和f，则与概率终止的协议是不可能的。
A set of mutually distrusting participants that want to agree on a common opinion must solve an instance of a Byzantine agreement problem. These problems have been extensively studied in the literature. However, most of the existing solutions assume that the participants are aware of n — the total number of participants in the system — and f — an upper bound on the number of Byzantine participants. In this paper, we show that most of the fundamental agreement problems can be solved without affecting resiliency even if the participants do not know the values of(possibly changing) n and f. Specifically, we consider a synchronous system where the participants have unique but not necessarily consecutive identifiers, and give Byzantine agreement algorithms for reliable broadcast, approximate agreement, rotor-coordinator, early terminating consensus and total ordering in static and dynamic systems, all with the optimal resiliency of n>3f. Moreover, we show that some synchrony is necessary as an agreement with probabilistic termination is impossible in a semi-synchronous or asynchronous system if the participants are unaware of n and f.
简短公告：面向对象共识
DOI：
10.1145/3087801.3087867
发表时间：
2017
期刊：
ACM Symposium on Principles of Distributed Computing
影响因子：
--
作者：
Afek, Yehuda;Aspnes, James;Cohen, Edo;Vainstein, Danny
通讯作者：
Vainstein, Danny