融合可验证随机函数的改进Raft共识算法

传统的Raft算法容易因受到恶意攻击而导致效率低下。针对Raft算法在执行过程中可能被攻击者探测到Leader身份进而发动攻击的问题,利用可验证随机函数的随机性和非交互式特性,改进了原有Raft算法，隐藏了选主过程中Leader的身份的同时避免了原算法的多轮选举问题。提出的改进Raft算法的详细设计了可验证随机函数的实现并将其融入到选主过程中,并且分析了改进方案的系统安全性和稳定性，对比了不同共识算法在各需求场景下的表现。仿真试验表明:改进后的算法在选主过程中隐藏了被选中节点的身份,在保证系统稳定性的前提下提高了系统安全性,并且在系统节点越来越多时提高选主的时间效率的表现更好。

An Improved Raft Consensus Algorithm for Integrating ECVRF

Raft consensus algorithm is a reliable consistency algorithm implementation in distributed systems, but the traditional Raft algorithm is easy to make efficiency low because of malicious attacks. Aimed at the problem that the leader identity in Raft algorithm may be detected by attackers in the process of execution and then attacked, the randomness and non-interactive characteristics of verifiable random functions are utilized for improving the original Raft algorithm, and hiding the leader identity in the leader election process, avoiding the multi-round election problem in the original algorithm. This paper designs an implementation of verifiable random functions in detail, and incorporates it into the leader election process. The paper also analyzes the system security and stability of the improved scheme, compares the performance of different consensus algorithms in various requirement scenarios. The simulation experiments show that the improved algorithm hides the identity of the elected node in the leader election process, improves the system security on the premise of ensuring system stability, and also performs still more in improving the time efficiency of leader election with the increase of the number in system nodes.