Blockchain key sharing and dynamic updating method based on an elliptic curve

Abstract

The invention discloses a blockchain key sharing and dynamic updating method based on an elliptic curve. The method comprises the steps of node key initialization, sub-key verification, main key synthesis, main key updating, sub-key addition and deletion and data encryption and decryption. Based on the idea of a threshold key sharing system, a linear equation set key sharing technology is proposedto distribute a block chain master key to each node, and the method can dynamically change the master key and add and delete the sub-keys on the premise of not changing node sub-keys, and is matchedwith a scene that the nodes in the block chain network are dynamically added and deleted. The purpose of the invention is to prevent fraud between nodes. According to the method, the sub-keys are distributed, an elliptic curve cryptosystem is combined, the method capable of identifying the authenticity of the sub-keys is also provided after the sub-keys are distributed, the trust problem between the nodes is guaranteed, the security of private data storage of the block chain is guaranteed, the credibility of the block chain system is enhanced, and related operations are defined in the smart contract and cannot be tampered.

Description

technical field [0001] The present invention relates to an elliptic curve cryptosystem, a shared key technology, and a block chain technology, in particular to a block chain key sharing and dynamic update method based on an elliptic curve. Background technique [0002] Elliptic curve cryptography is a public key encryption algorithm based on elliptic curve mathematics. The elliptic curve equation can be expressed as: y 2 =x 3 +ax+b, q>3. of which 4a 3 -27b 2 ≠0, a, b belong to finite field GF(q), q is a prime number or 2 m an integer of . There is a discrete logarithm problem on the elliptic curve, that is, for points K and G on the elliptic curve, satisfying K=kG, it is relatively easy to calculate K for a given k and G, but it is very difficult to solve k according to K and G, The operation performed by k and G here is the scalar multiplication on the finite field. It is precisely because of this characteristic that this difficult problem is applied in cryptograp...

AI Technical Summary

Problems solved by technology

However, in some scenarios, each blockchain node needs to share some data. For data security, the blockchain node will choose to encrypt and store the data, but at this time, who keeps the key pair used for encryption and decryption has become a new the puzzle

The traditional key splitting scheme does not support the dynamic addition and deletion of subkeys and the update of the master key, and is not suitable for the frequent addition and deletion of nodes in the blockchain network and the possible leakage of the master key.

Images