DBFT：弱协调者的高效拜占庭共识及其在联盟区块链中的应用
DBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains
摘要：
本文介绍了一种确定性的拜占庭共识算法，依赖于一个新的弱协调。相对于以前的算法，不能终止在一个有故障或缓慢的协调人的存在，我们的算法可以终止，即使它的协调人是错误的，因此名称弱协调人。其关键思想是允许进程在收到阈值消息后立即完成异步轮，而不必等待来自协调器的消息，因为这可能会很慢。由此产生的算法假设部分同步，是弹性最优，时间最优，不需要签名。我们的演讲是说教式的：本文首先提出了一个简单的安全的二进制拜占庭共识算法，并对其进行了修改以确保终止，最后提出了一个从多值共识到二进制共识的优化约简，该约简可以在4个消息延迟内终止。为了评估我们的算法，我们将其部署在分布在不同大陆的5个中心的100台机器上，并将其性能与来自Mostefaoui，Moulets和Raynal [PODC14]的随机解决方案进行了比较，该解决方案在O（1）回合中终止。我们的算法总是优于后者，即使在拜占庭行为的存在。我们的算法在大多数地理分布的实验中具有亚秒级的平均延迟，即使受到精心设计的拜占庭进程联盟的攻击也是如此。
英文摘要：
This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate even when its coordinator is faulty, hence the name weak coordinator. The key idea is to allow processes to complete asynchronous rounds as soon as they receive a threshold of messages, instead of having to wait for a message from a coordinator that may be slow. The resulting algorithm assumes partial synchrony, is resilience optimal, time optimal and does not need signatures. Our presentation is didactic: we first present a simple safe binary Byzantine consensus algorithm, modify it to ensure termination, and finally present an optimized reduction from multivalue consensus to binary consensus that may terminate in 4 message delays. To evaluate our algorithm, we deployed it on 100 machines distributed in 5 datacenters across different continents and compared its performance against the randomized solution from Mostefaoui, Moumem and Raynal [PODC14] that terminates in O(1) rounds in expectation. Our algorithm always outperforms the latter even in the presence of Byzantine behaviors. Our algorithm has a subsecond average latency in most of our geo-distributed experiments, even when attacked by a well-engineered coalition of Byzantine processes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
