Fast Agreement in Networks with Byzantine Nodes
Fast Agreement in Networks with Byzantine Nodes
复制标题
与拜占庭节点的网络中的快速协议
DOI：
10.4230/lipics.disc.2020.30
复制
发表时间：
2020
影响因子：
1.9
通讯作者：
J. Olkowski
中科院分区：
文献类型：
--
作者：
Bogdan S. Chlebus;D. Kowalski;J. Olkowski
我们在拜占庭式上的倾向或倾斜的意义上研究了有缺陷的拓扑的同步网络的共识。假设网络是（s + 1）连接的，我们可以通过byzantine故障来获得对于拜占庭节点的任何算法求解共识，在该网络上有一个网络G和算法的执行，将ω（t + d 2 t）回合。使用多项式大小的身份验证消息的拜占庭节点。在G上验证的消息少于T + 3回合，但是所有算法解决没有消息身份验证的共识需要至少在G上进行T + D回合，这将与拜占庭节点与拜占庭节点的共识分开。在任意连接拓扑的网络中的性能与完整的网络不同。节点未知。大小O（m log n），其中n是节点的数量，m是边缘的数量。 1） - 连接的网络，如果T节点可能崩溃。
We study Consensus in synchronous networks with arbitrary connected topologies. Nodes may be faulty, in the sense of either Byzantine or proneness to crashing. Let t denote a known upper bound on the number of faulty nodes, and D s denote a maximum diameter of a network obtained by removing up to s nodes, assuming the network is ( s + 1)-connected. We give an algorithm for Consensus running in time t + D 2 t with nodes subject to Byzantine faults. We show that, for any algorithm solving Consensus for Byzantine nodes, there is a network G and an execution of the algorithm on this network that takes Ω( t + D 2 t ) rounds. We give an algorithm solving Consensus in t + D t communication rounds with Byzantine nodes using authenticated messages of polynomial size. We show that for any numbers t and d > 4, there exists a network G and an algorithm solving Consensus with Byzantine nodes using authenticated messages in fewer than t + 3 rounds on G , but all algorithms solving Consensus without message authentication require at least t + d rounds on G . This separates Consensus with Byzantine nodes from Consensus with Byzantine nodes using message authentication, with respect to asymptotic time performance in networks of arbitrary connected topologies, which is unlike complete networks. Let f denote the number of failures actually occurring in an execution and unknown to the nodes. We develop an algorithm solving Consensus against crash failures and running in time O ( f + D f ), assuming only that nodes know their names and can differentiate among ports; this algorithm is also communication-efficient, by using messages of size O ( m log n ), where n is the number of nodes and m is the number of edges. We give a lower bound t + D t − 2 on the running time of any deterministic solution to Consensus in ( t + 1)-connected networks, if t nodes may crash.
本地广播模型下无向图的精确拜占庭共识
DOI：
10.1145/3293611.3331619
发表时间：
2019
期刊：
ACM Symposium on Principles in Distributed Computing
影响因子：
--
作者：
Khan, Muhammad Samir;Naqvi, Syed Shalan;Vaidya, Nitin H.
通讯作者：
Vaidya, Nitin H.