论文标题
使用加密和部分同步的简单有效的二进制拜占庭共识算法
A Simple and Efficient Binary Byzantine Consensus Algorithm using Cryptography and Partial Synchrony
论文作者
论文摘要
本文介绍了使用弱圆形协调器和部分同步假设来确保可耐受性的简单有效的二进制拜占庭式耐受性共识算法。在该算法中，非故障节点执行初始广播，然后执行一系列弹性，由单个消息广播，直到终止。每条消息都伴随着其有效性的加密证明。在奇数回合中，二进制值1可以在第0轮中确定。最高三分之一的节点可能是故障的，并且在故障数量的恒定因子的许多回合中确保终止。实验表明，可以在不到200毫秒的时间内达到终止，即使有部分初步分歧，也可以在5大洲遍布300个亚马逊EC2实例。
This paper describes a simple and efficient Binary Byzantine faulty tolerant consensus algorithm using a weak round coordinator and the partial synchrony assumption to ensure liveness. In the algorithm, non-faulty nodes perform an initial broadcast followed by a executing a series of rounds consisting of a single message broadcast until termination. Each message is accompanied by a cryptographic proof of its validity. In odd rounds the binary value 1 can be decided, in even round 0. Up to one third of the nodes can be faulty and termination is ensured within a number of round of a constant factor of the number of faults. Experiments show termination can be reached in less than 200 milliseconds with 300 Amazon EC2 instances spread across 5 continents even with partial initial disagreement.
