一种基于可验证秘密共享的区块链共识算法

Blockchain consensus algorithm based on verifiable secret sharing

共识算法对保证区块链的安全性和效率起着至关重要的作用,Raft算法作为一种强一致性、去中心化、高可用的分布式共识算法,被广泛应用在联盟链及私有链中.针对Raft算法在Leader节点选举过程中存在虚假投票及缺少拜占庭容错的问题,利用可验证秘密共享提出了一种基于可验证秘密共享的Raft共识算法,该算法通过可验证秘密共享的子秘密分发与承诺值验证的过程取代Raft共识算法中的投票和计票过程,并在秘密生成及验证过程中利用蒙哥马利幂剩余算法减少运算的复杂度.仿真结果表明:相比Raft算法,提出的算法在具有拜占庭容错能力且可以抵御伪造选票攻击的同时保持Leader节点切换低延迟,在提高安全性的同时也保证了其可扩展性.

Consensus algorithm plays an important role in ensuring the security and efficiency of blockchain.As a distributed algorithm characterized by strong consistency,decentralization,and high availability,the Raft algorithm is widely used in consortium blockchain and private blockchain.Using a verifiable secret sharing system,a Raft consensus algorithm based on verifiable secret sharing is proposed to address the problems of false voting and lack of Byzantine fault tolerance in the Leader node election process of Raft algorithm.The process of sub-secret distribution and commitment value verification through verifiable secret sharing replaces the voting and counting process in the Raft consensus algorithm,and the Montgomery power surplus algorithm is used to reduce the complexity of the operation in the algorithm key generation and verification process.Compared with the Raft algorithm,Simulation results show that the proposed scheme has Byzantine fault tolerance,and can resist forged ballot attacks while maintaining a low Leader node switching delay,which not only improves its security but also guarantees its scalability.