Research On Verifiable Byzantine Fault-Tolerant Consensus Mechanism Based On Secure Multi-Party Computing In Blockchain

Blockchain originated from Bitcoin.In 2008,Satoshi Nakamoto published the article "Bitcoin:A Peer-to-Peer Electronic Cash System",which marked the birth of Bitcoin and blockchain.Blockchain was originally proposed as the core underlying technology of Bitcoin.Through the use of data encryption,timestamps,distributed consensus and other means to achieve decentralized and trustless peer-to-peer transactions,it has gradually expanded to electronic contracts,Internet of Things,Insurance,copyright deposit and other fields.As the underlying technology of the blockchain,the consensus mechanism ensures that the correctness and consistency of the distributed ledger data are guaranteed,and it is a rule that every blockchain network node must abide by.The performance,security and scalability of a blockchain network largely depend on the algorithm design of its consensus mechanism.Verifiable Byzantine Fault-Tolerant(VBFT)consensus mechanism is currently a highly decentralized,scalable and efficient consensus mechanism,but it still has certain security issues.Secure multi-party computing technology is a better technology to solve the security problem in the blockchain.The purpose of secure multi-party computing is to solve how multiple parties can jointly and securely calculate an agreed function without a trusted third party,and to ensure the privacy of multi-party inputs during the calculation process.This coincides with the decentralization of the blockchain.Therefore,this article uses secure multi-party computing technology to solve the security problem in the VBFT consensus mechanism,and uses zero-knowledge proofs to ensure the correctness and reliability of the calculation during the calculation process.Verification.The main achievements and innovations of this paper are as follows:(1)A publicly verifiable random number generation scheme is proposed based on technologies such as secure multi-party computation and zero-knowledge proof.This scheme can make mutually distrustful parties generate a secure true random number together,and the authenticity and generation process of the random number can be verified by anyone.In this paper,the safety analysis of the scheme is carried out,and the safety and efficiency of the scheme are proved through efficiency analysis;(2)Based on elliptic curve encryption and zero-knowledge proof technologies,an improved DPOS node table construction scheme is proposed.This solution can hide the equity value of voting nodes voting on candidate consensus nodes during the construction of the DPOS node table,so that malicious voting nodes cannot use their voting power to control the selection of nodes in the node table and the ordering of nodes in the table;(3)Based on the proposed publicly verifiable random number generation scheme and the proposed improved DPOS node table construction scheme,an improved VBFT consensus mechanism is proposed.Two security vulnerabilities and possible attacks in the VBFT consensus mechanism are analyzed in detail.In view of the security issues in the VBFT consensus mechanism,in the new block stage of the consensus proposal,based on the proposed public and verifiable random number generation scheme based on secure multi-party calculation,multi-party joint generation of random numbers,replacing the verifiable verification in the classic VBFT consensus mechanism Random function is the method of generating random numbers,and the random numbers generated in the scheme of this article are used to determine the role types of nodes in the blockchain network and the sequence of block generation.In the initialization phase of the consensus,the proposed improved DPOS node table construction scheme is used to select and sort the candidate consensus nodes into the table,thereby ensuring the security of the consensus and effectively solving the security loopholes in the original consensus algorithm.Finally,the performance test of the improved VBFT consensus mechanism in this paper is carried out,and the running time is compared with the classic VBFT consensus mechanism.The test results show that the improved VBFT consensus mechanism proposed in this paper is more efficient when the threshold is low,and its running time is still within an acceptable range when the threshold is high.Therefore,the VBFT consensus mechanism mentioned in this article has practical application value.