论文标题
一种简单有效的异步随机二进制拜占庭共识算法
A Simple and Efficient Asynchronous Randomized Binary Byzantine Consensus Algorithm
论文作者
论文摘要
本文描述了一种简单有效的异步二进制拜占庭式耐受性共识算法。在算法中，非故障节点执行初始广播，然后执行一系列弹性，每个弹性由单个消息广播组成，并使用阈值签名计算全局随机硬币。每条消息都伴随着其有效性的加密证明。多达三分之一的节点可能是错误的，并且预计在恒定的回合中终止。描述了一个优化，允许将圆形消息加上硬币消息组合，将弹性降低到单个消息延迟。地理分布的实验是在十个数据中心区域的重复下进行的，显示平均潜伏期低至400毫秒。
This paper describes a simple and efficient asynchronous Binary Byzantine faulty tolerant consensus algorithm. In the algorithm, non-faulty nodes perform an initial broadcast followed by a executing a series of rounds each consisting of a single message broadcast plus the computation of a global random coin using threshold signatures. Each message is accompanied by a cryptographic proof of its validity. Up to one third of the nodes can be faulty and termination is expected in a constant number of rounds. An optimization is described allowing the round message plus the coin message to be combined, reducing rounds to a single message delay. Geodistributed experiments are run on replicates in ten data center regions showing average latencies as low as 400 milliseconds.
