Research On Proof Of Stake Based On Ring Signature

In recent years,the outbreak of the global trust crisis has led to rapid development of blockchain technology.Relying on the encryption technology,distributed network and consensus mechanism,the blockchain technology solves the problem that it is difficult to trust transactions under traditional distributed systems.The consensus mechanism is one of the core technologies of the blockchain.Most existing digital currencies use the proof of work,but the proof of work has the problem of excessive waste of resources.In order to solve the problem of resource waste,the blockchain community has proposed a proof of stake that uses stakes to replace computing power.The more stakes a node holds,the easier it is to obtain accounting rights.Although the problem of waste of resources is solved,the proof of stake still has the problems of easy fork and inability to nothing of attacks and adaptive corruption.To solve the above problems,we proposes a proof of stake based on ring signatures.The protocol first uses a verifiable random function to independently elect multiple candidates locally,then uses ring signatures to complete the public anonymous election of multiple candidates,and finally elect a block generator from multiple candidates and broadcasts the block.Around this agreement,the work of this article is mainly divided into the following parts:(1)We designed verifiable random functions based on bilinear pair,mainly including three algorithms: key generation algorithm,random number and proof generation algorithm,and random number verification algorithm.Compared with the existing verifiable random function scheme,this scheme has a shorter proof,which reduces the pressure of blockchain network broadcasting.(2)We designed a proof of stake protocol based on ring signatures.The protocol can elect a unique block generator for each block and hide the identity of the block generator during the election process,so the protocol can effectively solve the blockchain networks are prone to forks,and can provide security under an adaptive corruption model.(3)Based on the bilinear pair in the GMSSL library,the verifiable random function scheme and the ring signature scheme in the protocol are implemented,and the calculation of the bilinear pair in the GMSSL library is optimized.Compared with the original program,the performance of the optimized program can be increased by 90 times.