论文标题
在双方网络中达成高效的拜占庭协议
Reaching Efficient Byzantine Agreements in Bipartite Networks
论文作者
论文摘要
为了在部分连接的网络上达到有效的确定性同步拜占庭一致性，传统的广播原始性被扩展并与一般框架集成在一起。这样，拜占庭协议扩展到完全连接的两部分网络和一些两部分边界网络。在一般系统结构下，拜占庭一致性的复杂性与所谓的拜占庭式级别进行了优化。还提供了一些对蝴蝶网络的两部分模拟，以及在相同的系统结构下建立有效的不完整拜占庭一致性的两部分边界网络的某些精细属性。它表明，可以使用提供足够高的系统假设覆盖的提供的算法来构建有效的现实世界拜占庭协议系统。同时，所提出的双方溶液可以在某些开放，异构甚至对抗环境中提高系统的可靠性。
For reaching efficient deterministic synchronous Byzantine agreement upon partially connected networks, the traditional broadcast primitive is extended and integrated with a general framework. With this, the Byzantine agreement is extended to fully connected bipartite networks and some bipartite bounded-degree networks. The complexity of the Byzantine agreement is lowered and optimized with the so-called Byzantine-levers under a general system structure. Some bipartite simulation of the butterfly networks and some finer properties of bipartite bounded-degree networks are also provided for building efficient incomplete Byzantine agreement under the same system structure. It shows that efficient real-world Byzantine agreement systems can be built with the provided algorithms with sufficiently high system assumption coverage. Meanwhile, the proposed bipartite solutions can improve the dependability of the systems in some open, heterogeneous, and even antagonistic environments.
