论文标题
继电器协议达成拜占庭共识
Relay Protocol for Approximate Byzantine Consensus
论文作者
论文摘要
大概拜占庭共识是分布式计算的基本问题。本文提出了一种新的算法，以实现大致的拜占庭共识，称为中继ABC。该算法允许机器在存在拜占庭失败的情况下达成近似共识，以任意精确性。该算法依赖于继电器消息系统的使用和签名的消息，并具有每个节点独特的不可固定签名。签名和继电器的使用允许规避传统近乎拜占庭共识算法的严格必要网络条件。 我们还为中继ABC提供了有效性和收敛性的理论保证。为此，我们利用了一个想法，即网络中的状态可以通过一系列过渡矩阵来建模。我们扩展了以前的方法，它使用过渡矩阵来证明ABC收敛，它通过使每个状态向量模型不仅是一个迭代，还要让一组$ d $迭代，其中$ d $是图形的直径属性。这使我们能够准确地建模继电器系统内固有的消息的延迟。
Approximate byzantine consensus is a fundamental problem of distributed computing. This paper presents a novel algorithm for approximate byzantine consensus, called Relay-ABC. The algorithm allows machines to achieve approximate consensus to arbitrary exactness in the presence of byzantine failures. The algorithm relies on the usage of a relayed messaging system and signed messages with unforgeable signatures that are unique to each node. The use of signatures and relays allows the strict necessary network conditions of traditional approximate byzantine consensus algorithms to be circumvented. We also provide theoretical guarantees of validity and convergence for Relay-ABC. To do this, we utilize the idea that the iteration of states in the network can be modeled by a sequence of transition matrices. We extend previous methods, which use transition matrices to prove ABC convergence, by having each state vector model not just one iteration, but a set of $D$ iterations, where $D$ is a diameter property of the graph. This allows us to accurately model the delays of messages inherent within the relay system.
