Research On Improving Blockchain Consensus Algorithm Based On Verifiable Random Number Generation Scheme

Blockchain has received widespread attention and research from society and academia for its decentralization,immutability and traceability.Consensus algorithm is not only one of the core components of blockchain,but also a key technology to ensure blockchain security and improve blockchain performance.However,the application scenarios of blockchain are still very limited due to the shortcomings of consensus algorithms in terms of performance and security.If blockchain wants to be applied in more practical scenarios,it is necessary to break through the bottlenecks such as low security of consensus process and insufficient consensus performance in consensus algorithm,and find a suitable balance point in decentralization,scalability and security.To address these issues,this paper investigates the improvement and optimization of verifiable random number generation schemes and practical Byzantine faulttolerant consensus algorithms:(1)A verifiable random number generation scheme is proposed based on vector space.Compared with the verifiable random number generation scheme based on threshold secret sharing,the scheme has a flexible structure in generating verifiable random numbers,and different access structures can be set according to different scenarios,and the participants are no longer limited to quantitative relationships among themselves.Moreover,by designing different disclosure functions,the scheme can be converted into a threshold-based secret sharing verifiable random number generation scheme.In addition to this,the scheme also combines the fault-tolerance advantage of a threshold scheme,which can generate a verifiable random number even if a malicious participant in the scheme tampers with the data or goes offline.Moreover,the scheme can be executed by untrusted participants in a distributed environment without the need for a trusted third party,and any participant can verify the computation process and the result of the random number.In this paper,the scheme is analyzed for security,efficiency and experimental testing,and the analysis and experimental results show that the scheme has good performance and security.(2)An improved practical Byzantine fault-tolerant consensus algorithm is proposed based on a verifiable random number generation scheme.Firstly,to address the problem that the master node selection in the practical Byzantine fault-tolerant consensus algorithm is arbitrary and ignores the identity privacy security of key nodes,this paper uses a verifiable random number generation scheme based on vector space to select the consensus master node set and protect the privacy of key nodes.Secondly,to address the Byzantine node interference that occurs in the practical Byzantine fault-tolerant consensus algorithm due to the lack of node screening and evaluation and reward and punishment functions.Thirdly,to address the problem of Byzantine nodes interfering with the consensus process due to the lack of node screening evaluation and reward and punishment functions in practical Byzantine fault-tolerant consensus algorithms,this paper designs a node history behavior weight model.The model rewards or penalizes nodes based on their behaviors and their historical performance,making weight updates more reasonable so that the consensus algorithm can identify and record node behaviors and quantify node trustworthiness.Additionally,this paper improves the three-stage consistency process of the practical Byzantine fault-tolerant consensus algorithm by using the master node to collect and forward messages from slave nodes,reducing the communication overhead between nodes.Finally,this paper conducts comparative experiments with Byzantine node percentages from 0% to 30%,and the results show that the reliability and performance of the improved consensus algorithm are improved.