WO2023070831A1

WO2023070831A1 - Block confirmation method and device

Info

Publication number: WO2023070831A1
Application number: PCT/CN2021/135349
Authority: WO
Inventors: 李昊轩; 严强; 王朝阳; 廖飞强; 贺双洪; 李辉忠; 张开翔; 范瑞彬
Original assignee: 深圳前海微众银行股份有限公司
Priority date: 2021-10-27
Filing date: 2021-12-03
Publication date: 2023-05-04
Also published as: CN113706150A; CN113706150B

Abstract

A block confirmation method and device. The method comprises for any transaction, a client determining k block chain nodes from m block chain nodes as priority nodes (101); generating a first confounding factor on the basis of public keys of the k priority nodes (102); generating a first priority commitment on the basis of the first confounding factor and the transaction (103); generating a first priority transaction on the basis of the first priority commitment and a hash value of the transaction (104); and sending the first priority transaction to a block chain network (105). In this case, under the condition that the computing capabilities of the block chain nodes are the same or approximate, the priority nodes specified by the client have a great probability of first recovering the transaction by means of the first priority commitment in the first priority transaction, so as to rapidly complete the block confirmation process, thereby effectively improving the block on-chain efficiency. Moreover, the client confounds the transaction by means of the first confounding factor and then sends the confounded transaction to the block chain network, such that the privacy security of transaction data can be ensured.

Description

Method and device for block confirmation

Cross References to Related Applications

This application claims the priority of the Chinese patent application with the application number 202111254334.8 and the application title "A Block Confirmation Method and Device" submitted to the China Patent Office on October 27, 2021, the entire contents of which are incorporated by reference in this application middle.

technical field

Embodiments of the present invention relate to the field of financial technology (Fintech), and in particular to a block confirmation method and device.

Background technique

With the development of computer technology, more and more technologies are applied in the financial field, and the traditional financial industry is gradually transforming into financial technology. However, due to the security and real-time requirements of the financial industry, higher requirements are also placed on technology.

At this stage, based on the existing proof-of-work consensus protocol, each blockchain node in the blockchain network competes to complete the block confirmation process through computing power. Specifically, by setting up a proof-of-work mechanism to determine which node in the blockchain network will complete the block confirmation process, that is, to determine which node will perform the block operation and send the block As a block on the chain. Among them, the relationship between each blockchain node in the blockchain network is equal, and they all participate in the process of competing block confirmation with an equal identity, and the computing power of each blockchain node is the same. In addition, the proof-of-work mechanism is to hash a certain transaction in the respective transaction pool with a random number generated by itself, requiring the first number of digits of the calculated hash value to be 0, such as the first 6 digits is 0, that is, 000000. Then, each blockchain node in the blockchain network performs relevant hash operations according to the proof-of-work mechanism, and keeps looking for random numbers that meet the requirements. If a certain blockchain node finds out a random number that meets the requirements, The transaction, random number and hash value can be uploaded to the chain so that other blockchain nodes in the blockchain network can perform consensus verification. Other blockchain nodes only need to add the random number to the transaction for hashing. Greek operation, verify whether the number of digits before the calculated hash value is 0, and verify whether the calculated hash value is equal to the hash value on the chain, and after the verification is passed, it can be confirmed that the block chain Nodes package the transaction to generate an on-chain block. However, due to the fact that the relationship between each blockchain node in the blockchain network is equal, this processing method is applicable to a single business scenario and cannot be applied to different business scenarios (for example, the business scenarios in the alliance chain require There are blockchain nodes in each blockchain node that can take the lead in completing the block confirmation process), and the computing power of each blockchain node in the blockchain network of the existing technical solution is the same, then it is completed through the proof-of-work mechanism The block confirmation process will take a long time, resulting in low efficiency of block chaining.

To sum up, there is an urgent need for a block confirmation method, which is used to complete the process of block confirmation through priority nodes, so as to effectively improve the efficiency of block chaining.

Contents of the invention

Embodiments of the present invention provide a block confirmation method and device, which are used to complete the process of block confirmation through priority nodes first, so as to effectively improve the efficiency of block chaining.

In the first aspect, the embodiment of the present invention provides a block confirmation method, which is applicable to a block chain network with m block chain nodes, and the method includes:

For any transaction, the client determines k blockchain nodes from the m blockchain nodes as priority nodes;

The client generates a first confusion factor based on the public keys of the k priority nodes;

The client generates a first priority commitment based on the first confusion factor and the transaction;

The client generates a first priority transaction based on the first priority commitment and a hash value of the transaction, and sends the first priority transaction to the blockchain network.

In the above technical solution, since the relationship of each blockchain node in the blockchain network of the prior art solution is equal, and the computing power of each blockchain node is the same, the block confirmation algorithm involved in this prior art solution It is also aimed at each blockchain node in a peer-to-peer relationship, so it cannot support the block confirmation process with priority node requirements (that is, specifying some blockchain nodes to process transactions first). With the same computing power, no node can complete the block confirmation process first, so it takes a long time for each blockchain node to confirm the block through the workload proof mechanism, resulting in low efficiency of block chaining. Based on this, the technical solution in the present invention designates some blockchain nodes as priority nodes, so that when the computing capabilities of each blockchain node in the blockchain network are the same or close to each other, the priority nodes designated by the client have a great Probability can be the first to complete the block confirmation process, so it can save the time spent in the block confirmation process, thereby effectively improving the efficiency of block chaining. Specifically, for any transaction, the client can determine k blockchain nodes as priority nodes from the m blockchain nodes, and generate the first confusion factor based on the public keys of the k priority nodes. Based on the first confusion factor and the transaction, generate the first priority commitment, which is used as the node transaction confirmation certificate, and after generating the first priority transaction based on the first priority commitment and the hash value of the transaction, the The first priority transaction is sent to the block chain network, and a block chain node (such as a priority node) in the block chain network can take the lead in recovering the transaction through the first priority commitment in the first priority transaction. In this way, under the condition that the computing capabilities of each blockchain node in the blockchain network are the same or close to each other, the priority node designated by the client has a great probability of being the first to pass the first priority transaction in the first priority transaction. Promise to restore the transaction, so as to quickly complete the block confirmation process. Even if the computing power of each blockchain node is different, the priority node has a great probability to be the first to pass the first priority in the first priority transaction. Promise to restore the transaction, so as to quickly complete the block confirmation process, which can effectively improve the efficiency of block chaining. At the same time, since the client does not directly send the transaction to the blockchain network, but uses the first obfuscation factor to obfuscate the transaction, and sends the hash value of the transaction and the first priority commitment obtained after the obfuscation to Blockchain network, so the risk of transaction data leakage can be avoided, which can help ensure the privacy and security of transaction data.

Optionally, the client generates a first confusion factor based on the public keys of the k priority nodes, including:

When the client determines that the number k of priority nodes is 2, the public keys of the k priority nodes are generated through a bilinear mapping algorithm to generate the first confusion factor;

The client generates a first priority transaction based on the first priority commitment and the hash value of the transaction, including:

The client performs a hash operation on the transaction to generate a hash value of the transaction;

The client generates the first priority transaction according to the first priority commitment and the hash value of the transaction.

In the above technical solution, since the client can specify the number of priority nodes, and the priority transactions corresponding to different numbers of priority nodes are different, that is, the number of elements contained in the generated priority transactions is different, so this solution adopts Set different numbers of priority nodes to specify the process of completing block confirmation with a high probability through the priority nodes. Specifically, when the number k of priority nodes specified by the client is 2, the public keys of the two priority nodes are used to generate the first confusion factor through the bilinear mapping algorithm, and the first confusion factor is used to confuse the The transaction to be processed, that is, the first priority commitment generated by the first confusion factor and the transaction. Then, the first priority transaction corresponding to when the number k of designated priority nodes is 2 is generated through the first priority commitment and the hash value of the transaction. Among them, the first priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node (such as a priority node) in the blockchain network can first decrypt the transaction through the first priority commitment, In this way, under the premise of ensuring that a certain transaction that the client needs to process is not disclosed, only a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, thereby preventing the transaction from being tampered with or be stolen.

When determining that the number k of priority nodes is 1, the client determines a first priority placeholder based on an elliptic curve, and passes the first priority placeholder and the public keys of the k priority nodes through a double line A property mapping algorithm that generates the first confusion factor;

The client generates the first priority transaction according to the first priority commitment, the first priority placeholder, and the hash value of the transaction.

In the above technical solution, when the number k of priority nodes designated by the client is 1, in order to better conceal the identity of the priority nodes, the first priority placeholder is determined through the elliptic curve, and the first priority placeholder is used as A priority node is the dot field element of the cooperative operation in the bilinear mapping algorithm. Then the public key of one priority node and the first priority placeholder are used to generate the first confusion factor through the bilinear mapping algorithm, and the first confusion factor is used to confuse the transaction that the client needs to process, that is, through the first A confounding factor and the transaction generate the first priority commitment. Then, the first priority transaction corresponding to when the number k of designated priority nodes is 1 is generated through the first priority commitment and the hash value of the transaction. Among them, the first priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node (such as a priority node) in the blockchain network can first decrypt the transaction through the first priority commitment, In this way, under the premise of ensuring that a certain transaction that the client needs to process is not disclosed, only a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, thereby preventing the transaction from being tampered with or be stolen.

Optionally, also include:

When the client determines that the number k of priority nodes is 0, it determines two unequal second priority placeholders and third priority placeholders based on elliptic curves, and uses the second priority placeholder and the third priority placeholder The third priority placeholder generates a second confusion factor through a bilinear mapping algorithm;

The client generates a second priority commitment based on the second confusion factor and the transaction;

The client generates the second priority transaction according to the second priority commitment, the second priority placeholder, the third priority placeholder, and the hash value of the transaction, and sends the A second priority transaction is sent to the blockchain network.

In the above technical solution, when the number k of priority nodes designated by the client is 0, that is, the client does not designate a priority node. At this time, in order not to let others easily know whether the client has designated priority nodes or not The number of priority nodes specified by the client is used to better conceal the identity of the priority nodes, and in order to cooperate with the dot field operation in the bilinear mapping algorithm, it will be realized by generating two unequal priority placeholders. Specifically, two unequal second priority placeholders and third priority placeholders are determined through elliptic curves, and the second priority placeholder and the third priority placeholder are used as double The dot-field element of the fit operation in the linear mapping algorithm. Then pass the second priority placeholder and the third priority placeholder through the bilinear mapping algorithm to generate the second confusion factor, which is used to confuse the transaction that the client needs to process, that is, through the second The confusion factor and the transaction generate a second-priority commitment. Then, a second priority transaction corresponding to when the number k of designated priority nodes is 0 is generated through the second priority commitment and the hash value of the transaction. Wherein, the second priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node (such as a priority node) in the blockchain network can first decrypt the transaction through the second priority commitment, In this way, under the premise of ensuring that a certain transaction that the client needs to process is not disclosed, only a certain blockchain node in the blockchain network can first decrypt the transaction through the second priority commitment, thereby preventing the transaction from being tampered with or be stolen.

Optionally, the client generates a first priority commitment based on the first confusion factor and the transaction, including:

The client uses the first confusion factor and the transaction to generate a first priority commitment through an elliptic curve dot domain multiplication algorithm.

In the above technical solution, the client uses the elliptic curve point field multiplication algorithm to process the first obfuscation factor and the transaction, so that the transaction can be obfuscated, and the first priority commitment that meets the requirements of not disclosing transaction information is generated, and This can avoid the risk of leakage of a certain transaction information that the client needs to process, and help ensure the privacy and security of the transaction.

In the second aspect, the embodiment of the present invention provides a block confirmation method, which is suitable for a blockchain network with m blockchain nodes, and the method includes:

For any one of the m blockchain nodes, when the blockchain node detects the first priority transaction, it generates a first decrypted segment based on the private key of the blockchain node; The first priority transaction is generated by the client based on the first priority commitment and the hash value of the transaction; the first priority commitment is generated by the client based on the first confusion factor and the transaction; the first The confusion factor is generated by the client based on the public keys of the k priority nodes determined by the client from the m blockchain nodes;

The blockchain node generates a first decrypted transaction according to the first decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm;

When the block chain node determines that the hash value of the first decrypted transaction is equal to the hash value of the transaction in the first priority transaction, it packs the first decrypted transaction into a block and uploads it to the chain.

In the above technical solution, for any block chain node, when the block chain node detects the first priority transaction, the block chain node can try to decrypt the client through the elements contained in the first priority transaction. A transaction that needs to be processed. Specifically, the blockchain node generates the first decryption segment based on its own private key, and uses the first decryption segment and the first priority commitment in the first priority transaction through the bilinear mapping algorithm to generate the first decryption transaction , and then determine whether the blockchain node has successfully decrypted the transaction by judging whether the hash value of the first decrypted transaction is equal to the hash value of the transaction, so as to determine whether it is executed by the blockchain node The block generation operation for the transaction, that is, after other blockchain nodes successfully reach a consensus on the first decrypted transaction, the blockchain node packages the first decrypted transaction into a block and uploads it to the chain. Among them, if the blockchain node is a priority node, the priority node can have a great probability to be the first to pass the first priority transaction when the computing power of each blockchain node in the blockchain network is the same or close. The first priority commitment in the first priority transaction to decrypt the transaction, or in the case that the computing power of each blockchain node is different, there is also a great probability that the transaction can be decrypted first through the first priority commitment in the first priority transaction, so that The decrypted transaction can be packaged into a block, and the block is synchronized to other blockchain nodes for consensus, and then uploaded to the chain, which can effectively improve the efficiency of block chaining. At the same time, since the client sends to the blockchain network the hash value of the transaction and the first-priority transaction formed by the obfuscated first-priority commitment, it does not directly send the transaction to the blockchain network, so the transaction can be avoided. There is a risk of data leakage, which can help ensure the privacy and security of transaction data.

Optionally, when the blockchain node detects the first priority transaction, it generates a first decrypted segment based on the private key of the blockchain node, including:

When the block chain node indicates that k is 2 through the number of elements contained in the first priority transaction, the private key of the block chain node is generated through a number field inversion algorithm to generate the first decryption private key;

The block chain node obtains the public keys of the m block chain nodes from the block chain, and for the public key of any block chain node, according to the first decryption private key and the block chain The public key of the node is used to generate the first decrypted fragment.

In the above technical solution, since the client can specify different numbers of priority nodes, the elements contained in the generated priority transactions are also different, so any blockchain node decrypts the The method used in the transaction is also different. Specifically, for any blockchain node, when k is determined to be 2 by the number of elements contained in the first priority transaction, the blockchain node adopts the transaction decryption processing method corresponding to k being 2, that is, by The public key of any blockchain node and the first decryption private key generated by its own private key to generate the first decryption segment. Wherein, the first decrypted fragment is used to assist the blockchain node to decrypt a first decrypted transaction, and the blockchain node will judge whether the hash value of the decrypted first decrypted transaction is equal to the hash value of the transaction To determine whether the blockchain node has successfully decrypted the transaction, and after the equality is determined, the decrypted first decrypted transaction will be packaged into a block and synchronized to other blockchain nodes for consensus verification.

When the block chain node indicates that k is 1 through the number of elements contained in the first priority transaction, the private key of the block chain node is generated through a number field inversion algorithm to generate a first decryption private key;

The blockchain node obtains a first priority placeholder from the first priority transaction, and generates the first decryption segment according to the first decryption private key and the first priority placeholder.

In the above technical solution, for any blockchain node, when k is determined to be 1 by the number of elements contained in the first priority transaction, the blockchain node adopts the transaction decryption processing method corresponding to k being 1, that is, The first decryption fragment is generated by using the first decryption private key generated according to the first priority placeholder in the first priority transaction and its own private key. Wherein, the first decrypted fragment is used to assist the blockchain node to decrypt a first decrypted transaction, and the blockchain node will judge whether the hash value of the decrypted first decrypted transaction is equal to the hash value of the transaction To determine whether the blockchain node has successfully decrypted the transaction, and after the equality is determined, the decrypted first decrypted transaction will be packaged into a block and synchronized to other blockchain nodes for consensus verification.

Optionally, also include:

When the blockchain node detects the second priority transaction, it obtains two unequal second priority placeholders and third priority placeholders from the second priority transaction; The number of elements included indicates that k is 0;

The block chain node generates a second decryption fragment according to the second priority placeholder and the third priority placeholder;

The blockchain node generates a second decrypted transaction according to the second decrypted fragment and the second priority commitment in the second priority transaction through a bilinear mapping algorithm;

When the block chain node determines that the hash value of the second decrypted transaction is equal to the hash value of the transaction in the second priority transaction, it packs the second decrypted transaction into a block and uploads it to the chain.

In the above technical solution, for any blockchain node, when k is determined to be 0 by the number of elements contained in the second priority transaction, the blockchain node adopts the transaction decryption processing method corresponding to k being 0, that is, Generate the second decryption fragment through the second priority placeholder and the third priority placeholder in the second priority transaction, and pass the second decryption fragment and the second priority commitment in the second priority transaction through the double line property mapping algorithm to generate a second decrypted transaction. Then, judge whether the hash value of the second decrypted transaction is equal to the hash value of the transaction to judge whether the block chain node has successfully decrypted the transaction, so as to determine whether the block chain node performs the The block production operation for this transaction. That is, after the equality is determined, the blockchain node packs the second decrypted transaction and the hash value of the second decrypted transaction into a block, and synchronizes the block to other blockchain nodes for consensus Verification, if it is determined that the consensus is successful, the block will be uploaded to the chain.

Optionally, also include:

When the block chain node determines that the hash values of the first decrypted transactions corresponding to the m block chain nodes are not equal to the hash values of the transactions in the first priority transaction, from the block chain Obtain the public keys of m block chain nodes, and for the public key of any block chain node, use the public key of the block chain node through the number field inversion algorithm to generate the first decryption public key;

The block chain node generates a third decrypted segment based on the first decrypted public key;

The blockchain node generates a third decrypted transaction according to the third decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm;

When the block chain node determines that the hash value of the third decrypted transaction is equal to the hash value of the transaction in the first priority transaction, it packs the third decrypted transaction into a block and uploads it to the chain.

In the above technical solution, for any block chain node, when the block chain node determines that the hash value of each first decrypted transaction corresponding to the m block chain nodes is not equal to the hash value of the transaction, it can pass another A decryption method to decrypt the transaction. That is, the blockchain node processes the public key of any blockchain node through a number field inversion algorithm, generates a first decryption public key, and generates a third decryption segment based on the first decryption public key. Then, the third decrypted transaction is generated through the third decrypted fragment and the first priority commitment in the first priority transaction. Then, judge whether the hash value of the third decrypted transaction is equal to the hash value of the transaction to judge whether the block chain node has successfully decrypted the transaction, so as to determine whether the block chain node executes the The block production operation for this transaction. That is, after the equality is determined, the blockchain node packs the third decrypted transaction and the hash value of the third decrypted transaction into a block, and synchronizes the block to other blockchain nodes for consensus Verification, if it is determined that the consensus is successful, the block will be uploaded to the chain.

In a third aspect, an embodiment of the present invention provides a block confirmation device, which is suitable for a blockchain network with m blockchain nodes, and the device includes:

A determination unit, configured to determine k blockchain nodes from the m blockchain nodes as priority nodes for any transaction;

The first processing unit is configured to generate a first confusion factor based on the public keys of k priority nodes; generate a first priority commitment based on the first confusion factor and the transaction; and generate a first priority commitment based on the first priority commitment and the The hash value of the transaction generates a first priority transaction, and sends the first priority transaction to the blockchain network.

In the fourth aspect, the embodiment of the present invention provides a block confirmation device, which is suitable for a blockchain network with m blockchain nodes, and the device includes:

A generating unit, configured to generate a first decrypted segment based on the private key of the blockchain node when a first priority transaction is detected for any one of the m blockchain nodes; The first priority transaction is generated by the client based on the first priority commitment and the hash value of the transaction; the first priority commitment is generated by the client based on the first confusion factor and the transaction; the first confusion The factor is generated by the client based on the public keys of k priority nodes determined by the client from the m blockchain nodes;

The second processing unit is configured to generate a first decrypted transaction according to the first decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm; when determining the first decrypted transaction When the hash value of is equal to the hash value of the transaction in the first priority transaction, the first decrypted transaction is packaged as a block and uploaded to the chain.

In a fifth aspect, an embodiment of the present invention provides a computing device, including at least one processor and at least one memory, wherein the memory stores a computer program, and when the program is executed by the processor, the processing The device implements the block confirmation method described in any of the above first aspect or the above second aspect.

In a sixth aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores a computer program executable by a computing device, and when the program runs on the computing device, the computing device executes the above-mentioned first aspect or the block confirmation method described in any of the above-mentioned second aspects.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings that need to be used in the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention. For Those of ordinary skill in the art can also obtain other drawings based on these drawings without making creative efforts.

FIG. 1 is a schematic flow diagram of a block confirmation method provided by an embodiment of the present invention;

FIG. 2 is a schematic structural diagram of a block confirmation device provided by an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of another block confirmation device provided by an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of a computing device provided by an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only some of the embodiments of the present invention, rather than all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

Part of the terms involved in the embodiments of the present invention will firstly be explained below, so as to facilitate the understanding of those skilled in the art.

(1) Block: It is the basic unit of the process blockchain, consisting of a block header containing metadata and a block body containing transaction data. Among them, the block header mainly includes the hash of the parent block.

(2) Blockchain: It is a chain composed of a series of blocks. In addition to recording the data of this block, each block also records the Hash value of the previous block. In this way, a chain is formed. In addition, there are two core concepts of the blockchain: one is cryptography technology, and the other is the idea of decentralization. Based on these two concepts, the historical information on the blockchain cannot be tampered with. A block in the blockchain consists of a block header and a block body. Among them, the block header mainly includes the block height h, the hash of the previous block, etc., and the block body mainly stores transaction data.

(3) Bilinear mapping: it is a kind of cryptographic protocol that satisfies e(aR,bS)=e(R,S)^ab for any a, b∈Z _p ^* , R, S∈G, R, S are any points of G1. Assume that G1 is an additive cyclic group with generator P and order p, G2 is a multiplicative cyclic group with the same order as G1, and a and b are elements in Z _p ^* (prime cyclic group of order p).

(4) Elliptic curve group: A group is a set of a series of elements satisfying certain algebraic operations in cryptography, and an elliptic curve group is a set of elements constructed based on elliptic curve cryptography. In the elliptic curve group, uppercase letters such as G1 and G2 represent points on the elliptic curve, that is, point field elements, and point field elements have additive properties, such as G1+G2. A lowercase letter, such as a, represents a scalar, that is, an element of a number field, and an element of a number field has the properties of operations such as addition, multiplication, and power, such as a*b, a^b, a+b, etc.

Some of the terms involved in the embodiments of the present invention have been introduced above, and the technical features involved in the embodiments of the present invention will be introduced below.

Fig. 1 exemplarily shows the flow of a block confirmation method provided by an embodiment of the present invention, and the flow can be executed by a block confirmation device. Wherein, the block confirmation method is applicable to a blockchain network with m blockchain nodes.

As shown in Figure 1, the process specifically includes:

Step 101, for any transaction, the client determines k blockchain nodes from the m blockchain nodes as priority nodes.

In the embodiment of the present invention, when the client uploads a certain transaction to the blockchain network for processing, in order to realize that the computing power of each blockchain node is the same or close, the priority node can be the first to complete the block confirmation. The process can be realized by the client specifying a part of blockchain nodes as priority nodes. For example, k blockchain nodes can be selected from m blockchain nodes in the blockchain network as priority nodes. For example, the client specifies priority The number of nodes is 0, 1 or 2, etc. For example, if the number of designated priority nodes is 2, the client can randomly select 2 blockchain nodes from m blockchain nodes as priority node. Alternatively, the m blockchain nodes can be sorted according to their respective computing capabilities from large to small, and the top 2 blocks can be selected from the sorted m blockchain nodes Chain nodes act as priority nodes. Wherein, m and k are integers, and k≤m.

For example, assuming that there are 10 blockchain nodes in the blockchain network, when the client uploads a certain transaction to the blockchain network for processing, it can designate 2 blockchain nodes as priority nodes, then it can start from Among the 10 blockchain nodes in the blockchain network, 2 blockchain nodes are selected as priority nodes and added to the priority queue. Alternatively, the client can designate a blockchain node as a priority node, and then select a blockchain node from the 10 blockchain nodes in the blockchain network as a priority node and add it to the priority queue. Alternatively, the client can designate 0 blockchain nodes as priority nodes, then select 0 blockchain nodes from the 10 blockchain nodes in the blockchain network as priority nodes and add them to the priority queue.

Step 102, the client generates a first confusion factor based on the public keys of the k priority nodes.

Step 103, the client generates a first priority commitment based on the first confusion factor and the transaction.

Step 104, the client generates a first priority transaction based on the first priority commitment and the hash value of the transaction.

Step 105, the client sends the first priority transaction to the blockchain network.

In the embodiment of the present invention, when the client determines that the number k of priority nodes is 2, the public keys of the k priority nodes are passed through a bilinear mapping algorithm to generate a first confusion factor, which is used to confuse the client In this way, the client will not directly upload the transaction to the blockchain network, which can avoid the risk of transaction data leakage, which can help ensure the privacy and security of transaction data. Then the first confusion factor and the transaction are passed through the elliptic curve point field multiplication algorithm to generate the first priority commitment. Then, through the set hash algorithm, such as Message-Digest Algorithm 5 (Message-Digest Algorithm 5, MD5) or SHA256 algorithm, etc., the transaction to be processed by the client is hashed to generate the hash value of the transaction , and according to the first priority commitment and the hash value of the transaction, generate the first priority transaction, and send the first priority transaction to the blockchain network. Among them, the first priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, so as to ensure that no leakage Under the premise of a certain transaction that the client needs to process, only a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, so as to prevent the transaction from being tampered with or stolen.

Among them, before the client selects the priority node, each blockchain node in the blockchain network will first generate its own public key and private key, and upload its own public key to the blockchain. For example, for each blockchain node in the blockchain network, the blockchain node uses a random number generation algorithm on the elliptic curve number field to generate a 256-bit random number ri, and the 256-bit random number ri is used as the node block Confirm the private key and keep it private. Then according to the 256-bit random number ri, use the elliptic curve point field multiplication algorithm to calculate the node block confirmation public key pki, that is, pki=ri*G. Then, upload your own node block confirmation public key pki to the blockchain, and form a public key list pk_list on the blockchain, that is, pk_list={pk1,pk2,...,pkm}. Exemplarily, a certain blockchain node in the blockchain network, such as blockchain node 1, is described as an example. The blockchain node 1 uses a random number generation algorithm on the elliptic curve number field to generate a 256-bit Random number r1, the 256-bit random number r1 is used as the private key for node block confirmation, and then according to the 256-bit random number r1, use the elliptic curve point field multiplication algorithm to calculate the node block confirmation public key pk1, that is, pk1=r1*G . Then, upload your own node block confirmation public key pk1 to the blockchain.

Exemplarily, assuming that there are 5 blockchain nodes in the blockchain network, that is, blockchain node 1, blockchain node 2, blockchain node 3, blockchain node 4 and blockchain node 5, a certain When a client initiates a certain transaction (such as transaction tx), it will first select 2 blockchain nodes from the 5 blockchain nodes as priority nodes, such as selecting blockchain node 1 and blockchain node 1. Node 3 is the priority node. After the two priority nodes are selected, the public key of the two blockchain nodes can be obtained from the blockchain through any blockchain node in the blockchain network. Node 2 sends a request to obtain the public key of blockchain node 1 and the public key of blockchain node 3. After receiving the request, blockchain node 2 obtains the public key of blockchain node 1 from the blockchain pk1 and the public key pk3 of the blockchain node 3, and send the public key pk1 of the blockchain node 1 and the public key pk3 of the blockchain node 3 to the client. According to the public key pk1 of the blockchain node 1 and the public key pk3 of the blockchain node 3, the client generates a first confusion factor Y through a bilinear mapping algorithm, that is, Y=e(pk1, pk3). Then, according to the first confusion factor Y and the transaction tx, the first priority commitment P is obtained by using the elliptic curve point field multiplication algorithm, that is, P=Y*tx. The first priority commitment P is used as a voucher for node transaction confirmation. At the same time, the client performs a hash operation on the transaction tx through the MD5 or SHA256 algorithm to generate a hash value h of the transaction tx, that is, h=hash(tx). The hash value h is used as a factor to verify the correctness of the node transaction confirmation process. Then, according to the hash value h of the transaction tx and the first priority commitment P, a first priority transaction (P, h) is generated, and the first priority transaction (P, h) is sent to the blockchain network.

Or, when the client determines that the number k of priority nodes is 1, it determines the first priority placeholder based on the elliptic curve, and uses the first priority placeholder and the public keys of the k priority nodes through bilinear mapping Algorithm to generate the first confusion factor, which is used to confuse the transactions that the client needs to process, so that the client will not directly upload the transaction to the blockchain network, which can avoid the risk of transaction data leakage. This can help ensure the privacy and security of transaction data. Then the first confusion factor and the transaction are passed through the elliptic curve point field multiplication algorithm to generate the first priority commitment. Then, through the set hash algorithm, such as Message-Digest Algorithm 5 (Message-Digest Algorithm 5, MD5) or SHA256 algorithm, etc., the transaction to be processed by the client is hashed to generate the hash value of the transaction , and generate a first priority transaction according to the first priority commitment, the first priority placeholder and the hash value of the transaction, and send the first priority transaction to the blockchain network. Among them, the first priority commitment is used as a voucher for each blockchain node consensus to confirm the transaction, and a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, so as to ensure that no leakage Under the premise of a certain transaction that the client needs to process, only a certain blockchain node in the blockchain network can first decrypt the transaction through the first priority commitment, so as to prevent the transaction from being tampered with or stolen.

Exemplarily, continue to take the example of five blockchain nodes in the above blockchain network for description. When a client initiates a certain transaction (such as transaction tx), it will first obtain Select one blockchain node as the priority node among the nodes, for example, select blockchain node 1 as the priority node. After the 1 priority node is selected, the public key of the 1 blockchain node can be obtained from the blockchain through any blockchain node in the blockchain network. Node 3 sends a request to obtain the public key of blockchain node 1. After receiving the request, blockchain node 3 obtains the public key of blockchain node 1 from the blockchain and sends the blockchain node 1's public key is sent to the client. At the same time, in order to better conceal the identity of the priority node, the first priority placeholder will be determined through the elliptic curve, and the first priority placeholder is used as a dot field in the bilinear mapping algorithm for a priority node Elements, that is, the client generates a 256-bit random number r locally, and the 256-bit random number r is used as a placeholder temporary factor filled in the bilinear map, and the public point G on the elliptic curve and the placeholder temporary factor r , generate the first priority placeholder R through the elliptic curve point field multiplication algorithm, that is, R=r*G. Then, according to the public key pk1 of the block chain node 1 and the first priority placeholder R, the first confusion factor Y is generated through the bilinear mapping algorithm, that is, Y=e(pk1, R), and according to the first A confusion factor Y and the transaction tx, by using the elliptic curve dot field multiplication algorithm, obtain the first priority commitment P, that is, P=Y*tx. The first priority commitment P is used as a voucher for node transaction confirmation. At the same time, the client performs a hash operation on the transaction tx through the MD5 or SHA256 algorithm to generate a hash value h of the transaction tx, that is, h=hash(tx). The hash value h is used as a factor to verify the correctness of the node transaction confirmation process. Then, according to the first priority placeholder R, the hash value h of the transaction tx and the first priority commitment P, the first priority transaction (P, h, R) is generated, and the first priority transaction (P, h, R) sent to the blockchain network.

Or, when the client determines that the number k of priority nodes is 0, it determines two unequal second priority placeholders and third priority placeholders based on the elliptic curve, and uses the second priority placeholder and the third priority placeholder The priority placeholder uses a bilinear mapping algorithm to generate a second confusion factor, which is used to confuse the transaction that the client needs to process, so that the client will not directly upload the transaction to the blockchain network, The risk of leakage of transaction data can be avoided, thereby helping to ensure the privacy and security of transaction data. Then based on the second confusion factor and the transaction, a second priority commitment is generated. Then, through the set hash algorithm, such as Message-Digest Algorithm 5 (Message-Digest Algorithm 5, MD5) or SHA256 algorithm, etc., the transaction to be processed by the client is hashed to generate the hash value of the transaction , and generate a second priority transaction according to the second priority commitment, the second priority placeholder, the third priority placeholder and the hash value of the transaction, and send the second priority transaction to the blockchain network. Among them, the second priority commitment is used as a certificate for each blockchain node to confirm the transaction by consensus, and a certain blockchain node in the blockchain network can first decrypt the transaction through the second priority commitment, so as to ensure that it is not leaked Under the premise of a certain transaction that the client needs to process, only a certain blockchain node in the blockchain network can first decrypt the transaction through the second priority commitment, so as to prevent the transaction from being tampered with or stolen.

Exemplarily, continue to take the example of five blockchain nodes in the above blockchain network for description. When a client initiates a certain transaction (such as transaction tx), it will first obtain Among the nodes, 0 blockchain nodes are selected as priority nodes, that is, the client does not specify a priority node. At this time, in order not to let others easily know whether the client has a designated priority node or not to let others easily know the number of priority nodes designated by the client, so as to better hide the identity of the priority node, and in order to cooperate with the bilinear mapping algorithm Dotfield operations in will be implemented by generating two unequal precedence placeholders. That is, the client locally generates a 256-bit random number ra, which is used as a placeholder temporary factor a filled in the bilinear map, and at the same time locally generates another 256-bit random number rb, the 256-bit random number rb is used as the placeholder temporary factor b filled in the bilinear map, and the public point G on the elliptic curve and the placeholder temporary factor ra are used to generate the second priority placeholder Ra through the elliptic curve point field multiplication algorithm. That is, Ra=ra*G. At the same time, the public point G on the elliptic curve and the placeholder temporary factor rb are used to generate the third priority placeholder Rb through the elliptic curve point field multiplication algorithm, that is, Rb=rb*G. Wherein, the second priority placeholder Ra and the third priority placeholder Rb are used as dot field elements for cooperative operation in the bilinear mapping algorithm when there are 0 priority nodes. Then, according to the second priority placeholder Ra and the third priority placeholder Rb, through the bilinear mapping algorithm, generate the second confusion factor Y, that is, Y=e(Ra, Rb), and according to the second confusion factor Y The factor Y and the transaction tx, by using the elliptic curve point field multiplication algorithm, obtain the second priority commitment P, that is, P=Y*tx. The second priority commitment P is used as a voucher for node transaction confirmation. At the same time, the client performs a hash operation on the transaction tx through the MD5 or SHA256 algorithm to generate a hash value h of the transaction tx, that is, h=hash(tx). The hash value h is used as a factor to verify the correctness of the node transaction confirmation process. Then, generate a second priority transaction (P, h, Ra, Rb) according to the second priority placeholder Ra, the third priority placeholder Rb, the hash value h of the transaction tx and the second priority commitment P, And send the second priority transaction (P, h, Ra, Rb) to the blockchain network.

Step 106, for any one of the m blockchain nodes, when the blockchain node detects the first priority transaction, generate a first decryption based on the private key of the blockchain node Fragmentation.

Step 107, the blockchain node generates a first decrypted transaction according to the first decrypted segment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm.

Step 108, when the block chain node determines that the hash value of the first decrypted transaction is equal to the hash value of the transaction in the first priority transaction, pack the first decrypted transaction into a block for execution winding.

In the embodiment of the present invention, for any blockchain node, when the blockchain node detects the first priority transaction, the blockchain node can try to decrypt the customer A certain transaction that the terminal needs to process. Since the client can specify a different number of priority nodes, the elements contained in the generated priority transactions are also different, so any blockchain node uses the elements contained in the priority transaction to decrypt the transaction. The approach is also different. Specifically, for any blockchain node, when the blockchain node determines that k is 2 through the number of elements contained in the first priority transaction, it adopts the transaction decryption processing method corresponding to k being 2, that is, the The private key of the blockchain node generates the first decryption private key through the number field inversion algorithm, and obtains the public keys of m blockchain nodes from the blockchain, and for the public key of any blockchain node, According to the first decrypted private key and the public key of the block chain node, a first decrypted segment is generated, and the first decrypted segment is used to assist the block chain node to decrypt the first decrypted transaction. Then pass the first decryption fragment and the first priority commitment in the first priority transaction through the bilinear mapping algorithm to generate the first decryption transaction, and judge whether the hash value of the first decryption transaction is consistent with the hash value of the transaction Values are equal to determine whether the blockchain node has successfully decrypted the transaction, so as to determine whether the blockchain node performs the block generation operation for the transaction. That is, after it is determined that the hash value of the first decrypted transaction is equal to the hash value of the transaction, the first decrypted transaction and the hash value of the first decrypted transaction are packaged into a block, and the block is The block is synchronized to other blockchain nodes for consensus verification. If it is determined that the consensus of other blockchain nodes is successful, the block will be uploaded to the chain.

Exemplarily, continue to take five blockchain nodes in the above blockchain network as an example for description, for example, take blockchain node 1 detecting the first priority transaction as an example, the blockchain node 1 reads For the first priority transaction, it is determined that the number of elements contained in the first priority transaction is 2, that is, (P, h), at this time through a well-known correspondence between the blockchain network and the client, namely The corresponding relationship between the number contained in the priority transaction and the number of priority nodes can be judged that k is 2, that is, there are 2 priority nodes in the priority queue, so that the transaction decryption processing corresponding to k is 2 can be used Way. The specific process of the transaction decryption processing method is as follows:

Step a, blockchain node 1 generates the first decryption private key rv through its own private key r1 through the number field inversion algorithm, that is, rv=-r1.

Step b. The blockchain node 1 reads the blockchain node public key list pk_list={pk1,pk2,...,pkm} from the blockchain, and the public key list pk_list can be used as a block confirmation decryption parameter.

Step c, the blockchain node 1 traverses each element in the public key list pk_list in turn, such as traversing to the public key pki, and generates the first decrypted segment T according to the first decrypted private key rv and the public key pki, That is, T=(rv*G,pki).

Step d, the blockchain node 1 generates the first decrypted transaction tx_try through the first decrypted segment T and the first priority commitment P in the first priority transaction through a bilinear mapping algorithm, that is, tx_try=P*T. Specifically, when calculating the first decrypted transaction tx_try, the calculation can be performed in the following manner, that is, tx_try=e(pk1,pk3)*tx*e(rv*G,pki)=e(r1*G,r3* G)*tx*e(-r1*G,ri*G)=tx*e(G,G)^r1r3*e(G,G)^-r1ri=tx*e(G,G)^(r1r3- r1ri). It can be seen that, when ri=r3, then r1r3-r1ri=r1r3-r1r3=0, and tx_try=tx*e(G,G)^0=tx can be obtained.

Step e, the blockchain node 1 performs a hash operation on the first decrypted transaction tx_try through a set hash algorithm, such as MD5 or SHA256 algorithm, to generate a hash value h' of the first decrypted transaction tx_try, That is h'=hash(tx_try).

Step f, the blockchain node 1 determines whether the hash value h' of the first decrypted transaction tx_try is equal to the hash value h of the transaction in the first priority transaction. If it is determined that they are equal, the first decrypted transaction tx_try and the hash value h' of the first decrypted transaction tx_try can be packaged into a block, and the block is synchronized to other blockchain nodes for consensus verification. If the consensus of each blockchain node is successful, the block will be uploaded to the chain. If it is determined that they are not equal, re-execute steps a to f until other blockchain nodes synchronize the correct tx_try, or until the hash value h' of the first decrypted transaction tx_try and the hash value h' in the first priority transaction are successfully obtained. The hash values h of the transactions are equal.

It should be noted that if the blockchain node that executes the specific process of the above transaction decryption processing method is in the priority queue, that is, the blockchain node is the priority node, then the specific process of executing the above transaction decryption processing method must be successful The decrypted transaction, that is, the first decrypted transaction obtained through decryption is the transaction that the client needs to process. Assuming that there are m blockchain nodes in the blockchain network, the transaction can be successfully decrypted after an average of m/2 attempts. If the blockchain node that executes the specific process of the above-mentioned transaction decryption processing method is not in the priority queue, that is, the blockchain node is not a priority node, then the blockchain node continues to traverse the public key list pk_list. When the key pki is used, the public key pki is passed through the number field inversion algorithm (ie, the elliptic curve point field inverse element algorithm) to generate the decrypted public key pk', that is, pk'=-pki, and at the same time, the other key in the public key list pk_list is sequentially taken out One public key pkj, the other public key pkj is any public key taken out in sequence in the public key list pk_list. According to the decrypted public key pk' and another public key pkj, a decrypted segment T is generated, that is, T=(-pki,pkj). Then, the decrypted segment T and the first priority commitment P in the first priority transaction are passed through the bilinear mapping algorithm to generate the decrypted transaction tx_try, that is, tx_try=P*T, until the correct result hash (tx_try) is traversed. Assuming that there are m blockchain nodes in the blockchain network, an average of m*(m-1)/2 attempts are made to successfully decrypt the transaction.

Or, for any blockchain node, when the blockchain node determines that k is 1 through the number of elements contained in the first priority transaction, it adopts the transaction decryption processing method corresponding to k being 1, that is, the block The private key of the block chain node generates the first decryption private key through the number field inversion algorithm, and obtains the first priority placeholder from the first priority transaction, and according to the first decryption private key and the first priority placeholder symbol to generate a first decrypted segment, and the first decrypted segment is used to assist the block chain node to decrypt the first decrypted transaction. Then pass the first decryption fragment and the first priority commitment in the first priority transaction through the bilinear mapping algorithm to generate the first decryption transaction, and judge whether the hash value of the first decryption transaction is consistent with the hash value of the transaction Values are equal to determine whether the blockchain node has successfully decrypted the transaction, so as to determine whether the blockchain node performs the block generation operation for the transaction. That is, after it is determined that the hash value of the first decrypted transaction is equal to the hash value of the transaction, the first decrypted transaction and the hash value of the first decrypted transaction are packaged into a block, and the block is The block is synchronized to other blockchain nodes for consensus verification. If it is determined that the consensus of other blockchain nodes is successful, the block will be uploaded to the chain. In addition, when the number k of priority nodes is 1, if the block chain node determines that it has not successfully decrypted the transaction through the above method, and determines the first decrypted transaction corresponding to the other m-1 block chain nodes If the hash value and the hash value of the transaction are not equal, another transaction decryption processing method can be used for processing. Specifically, the public keys of m blockchain nodes are obtained from the blockchain, and for the public key of any blockchain node, the public key of the blockchain node is generated through the number field inversion algorithm to generate the first The public key is decrypted, and a third decrypted segment is generated based on the first decrypted public key and the first priority placeholder in the first priority transaction. Then, through the bilinear mapping algorithm, according to the third decryption segment and the first priority commitment in the first priority transaction, a third decryption transaction is generated, and then it is judged whether the hash value of the third decryption transaction is consistent with the hash value of the transaction Values are equal to determine whether the blockchain node has successfully decrypted the transaction, so as to determine whether the blockchain node performs the block generation operation for the transaction. That is, after the equality is determined, the blockchain node packs the third decrypted transaction and the hash value of the third decrypted transaction into a block, and synchronizes the block to other blockchain nodes for consensus Verification, if it is determined that the consensus is successful, the block will be uploaded to the chain.

Exemplarily, continue to take five blockchain nodes in the above blockchain network as an example for description, for example, take blockchain node 1 detecting the first priority transaction as an example, the blockchain node 1 reads The first priority transaction, determine that the number of elements contained in the first priority transaction is 3, namely (P, h, R), at this time through a well-known correspondence between the blockchain network and the client , that is, the corresponding relationship between the number contained in the priority transaction and the number of priority nodes, it can be judged that k is 1, that is, there is 1 priority node in the priority queue, so the transaction corresponding to k being 1 can be used Decryption processing method. The specific process of the transaction decryption processing method is as follows:

Step b. The blockchain node 1 generates a first decryption segment T according to the first decryption private key rv and the first priority placeholder R in the first priority transaction, that is, T=(rv*G, R).

Step c, the blockchain node 1 generates the first decrypted transaction tx_try through the first decrypted segment T and the first priority commitment P in the first priority transaction through a bilinear mapping algorithm, that is, tx_try=P*T. Specifically, when calculating the first decrypted transaction tx_try, it can be calculated in the following manner, that is, tx_try=e(pk1,R)*tx*e(rv*G,R)=e(r1*G,r* G)*tx*e(-r1*G,r*G)=tx*e(G,G)^r1r*e(G,G)^-r1r=tx*e(G,G)^(r1r- r1r)=tx*e(G,G)^0=tx.

Step d, the blockchain node 1 performs a hash operation on the first decrypted transaction tx_try through a set hash algorithm, such as MD5 or SHA256 algorithm, to generate a hash value h' of the first decrypted transaction tx_try, That is h'=hash(tx_try).

Step e, the blockchain node 1 determines whether the hash value h' of the first decrypted transaction tx_try is equal to the hash value h of the transaction in the first priority transaction. If it is determined that they are equal, the first decrypted transaction tx_try and the hash value h' of the first decrypted transaction tx_try can be packaged into a block, and the block is synchronized to other blockchain nodes for consensus verification. If the consensus of each block chain node is successful, the block will be uploaded to the chain, and at the same time, it will be determined as the priority node and the operation will be terminated. If it is determined that they are not equal, step f is performed.

Step f, the blockchain node 1 determines whether there are other blockchain nodes synchronizing the block for the transaction, and if so, performs a hash operation on the decrypted transaction in the block through the set hash operation to determine the Decrypt the hash value of the transaction, and verify whether the hash value of the decrypted transaction is equal to the hash value of the transaction in the block. If it is determined that they are equal, the operation is terminated. If it is determined that they are not equal, step g is performed.

Step g, the blockchain node 1 reads the blockchain node public key list pk_list={pk1,pk2,...,pkm} from the blockchain, and the public key list pk_list can be used as a block confirmation decryption parameter.

Step h, the blockchain node 1 traverses each element in the public key list pk_list in turn, such as traversing to the public key pki, and passes the public key pki through the number field inversion algorithm (ie, the elliptic curve point field inverse element algorithm) , to generate the decryption public key pkv, that is, pkv=-pki.

Step i, the block chain node 1 generates a third decryption segment T according to the decryption public key pkv and the first priority placeholder R in the first priority transaction, that is, T=(pkv, R).

Step j, the blockchain node 1 generates the third decrypted transaction tx_try by using the third decrypted segment T and the first priority commitment P in the first priority transaction through a bilinear mapping algorithm, that is, tx_try=P*T. Specifically, when calculating the first decrypted transaction tx_try, the calculation can be performed in the following manner, that is, tx_try=e(pk1,R)*tx*e(pkv,R)=e(r1*G,r*G) *tx*e(-ri*G,r*G)=tx*e(G,G)^r1r*e(G,G)^-rir=tx*e(G,G)^(r1r-rir) . It can be seen that, when ri=r1, then r1r-rir=r1r-r1r=0, tx_try=tx*e(G,G)^0=tx can be obtained.

Step k, the blockchain node 1 performs a hash operation on the first decrypted transaction tx_try through a set hash algorithm, such as MD5 or SHA256 algorithm, to generate a hash value h' of the first decrypted transaction tx_try, That is h'=hash(tx_try).

Step 1, the blockchain node 1 determines whether the hash value h' of the first decrypted transaction tx_try is equal to the hash value h of the transaction in the first priority transaction. If it is determined that they are equal, the third decrypted transaction tx_try and the hash value h' of the third decrypted transaction tx_try can be packaged into a block, and the block is synchronized to other blockchain nodes for consensus verification. If the consensus of each blockchain node is successful, the block will be uploaded to the chain. If it is determined that they are not equal, re-execute step h to step l until the correct tx_try is synchronized by other blockchain nodes, or until the hash value h' of the third decrypted transaction tx_try and the hash value h' of the first priority transaction are successfully obtained The hash values h of the transactions are equal.

It should be noted that if the blockchain node that executes the specific process of the above transaction decryption processing method is in the priority queue, that is, the blockchain node is the priority node, then only one time is required to execute the specific process of the above transaction decryption processing method. The transaction can be successfully decrypted during the process, that is, the first decrypted transaction obtained by decryption is the transaction that the client needs to process. If the blockchain node that performs the specific process of the above transaction decryption processing method is not in the priority queue, assuming that there are m blockchain nodes in the blockchain network, it will take m/2 attempts on average to successfully decrypt the transaction.

Or, for any blockchain node, when the blockchain node determines that k is 0 through the number of elements contained in the second priority transaction, it adopts the transaction decryption processing method corresponding to k being 0, that is, from the second Two unequal second priority placeholders and third priority placeholders are obtained in the priority transaction, and a second decryption fragment is generated according to the second priority placeholder and the third priority placeholder. Then, through the bilinear mapping algorithm, according to the second decryption fragment and the second priority commitment in the second priority transaction, generate the second decryption transaction, and judge whether the hash value of the second decryption transaction is consistent with the hash value of the transaction The hash values are equal to determine whether the block chain node has successfully decrypted the transaction, so as to determine whether the block chain node performs the block production operation for the transaction. That is, after the equality is determined, the blockchain node packs the second decrypted transaction and the hash value of the second decrypted transaction into a block, and synchronizes the block to other blockchain nodes for consensus Verification, if it is determined that the consensus is successful, the block will be uploaded to the chain.

Exemplarily, continue to take five blockchain nodes in the above blockchain network as an example for description, for example, take blockchain node 1 detecting the second priority transaction as an example, the blockchain node 1 reads For the second priority transaction, it is determined that the number of elements contained in the second priority transaction is 4, namely (P, h, Ra, Rb). Correspondence, that is, the corresponding relationship between the number contained in the priority transaction and the number of priority nodes, it can be judged that k is 0, that is, there are 0 priority nodes in the priority queue, so the corresponding relationship between k and 0 can be used transaction decryption processing method. The specific process of the transaction decryption processing method is as follows:

Step a, blockchain node 1 obtains the second priority placeholder Ra and the third priority placeholder Rb from the second priority transaction, and according to the second priority placeholder Ra and the third priority placeholder Rb, Generate the second decryption segment T, that is, T=(-Ra, Rb).

Step b. The blockchain node 1 generates a second decrypted transaction tx_try by using the second decrypted segment T and the second priority commitment P in the second priority transaction through a bilinear mapping algorithm, that is, tx_try=P*T. Specifically, when calculating the first decrypted transaction tx_try, it can be calculated in the following manner, that is, tx_try=e(Ra, Rb)*tx*e(-Ra, Rb)=e(ra*G, rb*G )*tx*e(-ra*G,rb*G)=tx*e(G,G)^rarb*e(G,G)^-rarb=tx*e(G,G)^(rarb-rarb )=tx*e(G,G)^0=tx.

Step c, the blockchain node 1 performs a hash operation on the second decrypted transaction tx_try through a set hash algorithm, such as MD5 or SHA256 algorithm, to generate a hash value h" of the second decrypted transaction tx_try, That is h"=hash(tx_try).

Step d, the block chain node 1 determines whether the hash value h" of the second decrypted transaction tx_try is equal to the hash value h" of the transaction in the second priority transaction. If it is determined to be equal, the second decrypted transaction can be tx_try and the hash value h” of the second decrypted transaction tx_try are packaged into a block, and the block is synchronized to other blockchain nodes for consensus verification. If it is determined that the consensus of other blockchain nodes is successful, the block Go to the chain. If it is determined that they are not equal, it will prompt that the transaction is abnormal and terminate the transaction.

The above-mentioned embodiment shows that, since the relationship of each blockchain node in the blockchain network of the prior art solution is equal, and the computing power of each blockchain node is the same, the block confirmation algorithm involved in this prior art solution It is also aimed at each blockchain node in a peer-to-peer relationship, so it cannot support the block confirmation process with priority node requirements (that is, specifying some blockchain nodes to process transactions first). With the same computing power, no node can complete the block confirmation process first, so it takes a long time for each blockchain node to confirm the block through the workload proof mechanism, resulting in low efficiency of block chaining. Based on this, the technical solution in the present invention designates some blockchain nodes as priority nodes, so that when the computing capabilities of each blockchain node in the blockchain network are the same or close to each other, the priority nodes designated by the client have a great Probability can be the first to complete the block confirmation process, so it can save the time spent in the block confirmation process, thereby effectively improving the efficiency of block chaining. Specifically, for any transaction, the client can determine k blockchain nodes as priority nodes from the m blockchain nodes, and generate the first confusion factor based on the public keys of the k priority nodes. Based on the first confusion factor and the transaction, generate the first priority commitment, which is used as the node transaction confirmation certificate, and after generating the first priority transaction based on the first priority commitment and the hash value of the transaction, the The first priority transaction is sent to the block chain network, and a block chain node (such as a priority node) in the block chain network can take the lead in recovering the transaction through the first priority commitment in the first priority transaction. In this way, under the condition that the computing capabilities of each blockchain node in the blockchain network are the same or close to each other, the priority node designated by the client has a great probability of being the first to pass the first priority transaction in the first priority transaction. Promise to restore the transaction, so as to quickly complete the block confirmation process. Even if the computing power of each blockchain node is different, the priority node has a great probability to be the first to pass the first priority in the first priority transaction. Promise to restore the transaction, so as to quickly complete the block confirmation process, which can effectively improve the efficiency of block chaining. At the same time, since the client does not directly send the transaction to the blockchain network, but uses the first obfuscation factor to obfuscate the transaction, and sends the hash value of the transaction and the first priority commitment obtained after the obfuscation to Blockchain network, so the risk of transaction data leakage can be avoided, which can help ensure the privacy and security of transaction data.

Based on the same technical concept, FIG. 2 exemplarily shows a block confirmation device provided by an embodiment of the present invention, and the device can execute the flow of the block confirmation method. Wherein, the block confirmation method is applicable to a blockchain network with m blockchain nodes.

As shown in Figure 2, the device includes:

The determination unit 201 is configured to determine k blockchain nodes from the m blockchain nodes as priority nodes for any transaction;

The first processing unit 202 is configured to generate a first confusion factor based on the public keys of the k priority nodes; generate a first priority commitment based on the first confusion factor and the transaction; and generate a first priority commitment based on the first priority commitment and the The hash value of the transaction is used to generate a first priority transaction, and the first priority transaction is sent to the block chain network.

Optionally, the first processing unit 202 is specifically configured to:

When determining that the number k of priority nodes is 2, the public keys of the k priority nodes are passed through a bilinear mapping algorithm to generate the first confusion factor;

The first processing unit 202 is specifically used for:

performing a hash operation on the transaction to generate a hash value of the transaction;

The first priority transaction is generated according to the first priority commitment and the hash value of the transaction.

Optionally, the first processing unit 202 is specifically configured to:

When determining that the number k of priority nodes is 1, determine a first priority placeholder based on an elliptic curve, and pass the first priority placeholder and the public keys of the k priority nodes through a bilinear mapping algorithm, generating said first aliasing factor;

The first processing unit 202 is specifically used for:

The first priority transaction is generated according to the first priority commitment, the first priority placeholder, and the hash value of the transaction.

Optionally, the first processing unit 202 is further configured to:

When it is determined that the number k of priority nodes is 0, two unequal second priority placeholders and third priority placeholders are determined based on the elliptic curve, and the second priority placeholder and the third priority placeholder The first placeholder generates the second confusion factor through the bilinear mapping algorithm;

generating a second priority commitment based on the second obfuscation factor and the transaction;

Generate the second priority transaction according to the second priority commitment, the second priority placeholder, the third priority placeholder, and the hash value of the transaction, and convert the second priority transaction sent to the blockchain network.

Optionally, the first processing unit 202 is specifically configured to:

Using the first confusion factor and the transaction through an elliptic curve point domain multiplication algorithm to generate a first priority commitment.

Based on the same technical concept, FIG. 3 exemplarily shows another block confirmation device provided by an embodiment of the present invention, and the device can execute the flow of the block confirmation method. Wherein, the block confirmation method is applicable to a blockchain network with m blockchain nodes.

As shown in Figure 3, the device includes:

The generating unit 301 is configured to generate a first decrypted segment based on the private key of the blockchain node for any one of the m blockchain nodes when the first priority transaction is detected; The first priority transaction is generated by the client based on the first priority commitment and the hash value of the transaction; the first priority commitment is generated by the client based on the first confusion factor and the transaction; the first The confusion factor is generated by the client based on the public keys of the k priority nodes determined by the client from the m blockchain nodes;

The second processing unit 302 is configured to use a bilinear mapping algorithm to generate a first decrypted transaction according to the first decrypted fragment and the first priority commitment in the first priority transaction; When the hash value of the transaction is equal to the hash value of the transaction in the first priority transaction, the first decrypted transaction is packed into a block and uploaded to the chain.

Optionally, the generating unit 301 is specifically configured to:

When the number of elements contained in the first priority transaction indicates that k is 2, the private key of the blockchain node is passed through a number field inversion algorithm to generate a first decryption private key;

Obtain the public keys of the m blockchain nodes from the blockchain, and generate according to the first decryption private key and the public key of the blockchain node for the public key of any blockchain node The first decrypted segment.

Optionally, the generating unit 301 is specifically configured to:

When the number of elements contained in the first priority transaction indicates that k is 1, the private key of the blockchain node is passed through a number field inversion algorithm to generate a first decryption private key;

Obtain a first priority placeholder from the first priority transaction, and generate the first decryption fragment according to the first decryption private key and the first priority placeholder.

Optionally, the second processing unit 302 is further configured to:

When a second priority transaction is detected, two unequal second priority placeholders and a third priority placeholder are obtained from the second priority transaction; an indication of the number of elements contained in the second priority transaction k is 0;

generating a second decrypted segment according to the second priority placeholder and the third priority placeholder;

generating a second decrypted transaction according to the second decrypted fragment and the second priority commitment in the second priority transaction through a bilinear mapping algorithm;

When it is determined that the hash value of the second decrypted transaction is equal to the hash value of the transaction in the second priority transaction, the second decrypted transaction is packaged into a block and uploaded to the chain.

Optionally, the second processing unit 302 is further configured to:

When it is determined that the hash values of the first decrypted transactions corresponding to the m blockchain nodes are not equal to the hash values of the transactions in the first priority transaction, m blocks are obtained from the blockchain The public key of the chain node, and for the public key of any blockchain node, the public key of the blockchain node is passed through the number field inversion algorithm to generate the first decryption public key;

generating a third decryption slice based on the first decryption public key;

generating a third decrypted transaction according to the third decrypted segment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm;

When it is determined that the hash value of the third decrypted transaction is equal to the hash value of the transaction in the first priority transaction, the third decrypted transaction is packaged into a block and uploaded to the chain.

Based on the same technical concept, the embodiment of the present invention also provides a computing device, as shown in FIG. 4 , including at least one processor 401 and a memory 402 connected to the at least one processor. The specific connection medium between the processor 401 and the memory 402, the bus connection between the processor 401 and the memory 402 in FIG. 4 is taken as an example. The bus can be divided into address bus, data bus, control bus and so on.

In the embodiment of the present invention, the memory 402 stores instructions that can be executed by at least one processor 401, and at least one processor 401 can execute the steps included in the aforementioned block confirmation method by executing the instructions stored in the memory 402.

Among them, the processor 401 is the control center of the computing device, which can use various interfaces and lines to connect various parts of the computing device, by running or executing instructions stored in the memory 402 and calling data stored in the memory 402, thereby realizing data deal with. Optionally, the processor 401 may include one or more processing units, and the processor 401 may integrate an application processor and a modem processor. The call processor mainly handles issuing instructions. It can be understood that the foregoing modem processor may not be integrated into the processor 401 . In some embodiments, the processor 401 and the memory 402 can be implemented on the same chip, and in some embodiments, they can also be implemented on independent chips.

The processor 401 can be a general processor, such as a central processing unit (CPU), a digital signal processor, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array or other programmable logic devices, discrete gates or transistors Logic devices and discrete hardware components can implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiment of the block confirmation method can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor.

The memory 402, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs and modules. Memory 402 can include at least one type of storage medium, for example, can include flash memory, hard disk, multimedia card, card memory, random access memory (Random Access Memory, RAM), static random access memory (Static Random Access Memory, SRAM), Programmable Read Only Memory (PROM), Read Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Magnetic Memory, Disk , CD, etc. Memory 402 is, but is not limited to, any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 402 in the embodiment of the present invention may also be a circuit or any other device capable of implementing a storage function, and is used for storing program instructions and/or data.

Based on the same technical idea, an embodiment of the present invention also provides a computer-readable storage medium, which stores a computer program executable by a computing device, and when the program is run on the computing device, the computing device Execute the steps of the block confirmation method described above.

Those skilled in the art should understand that the embodiments of the present invention may be provided as methods, systems, or computer program products. Accordingly, the present invention can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to the invention. It should be understood that each procedure and/or block in the flowchart and/or block diagram, and a combination of procedures and/or blocks in the flowchart and/or block diagram can be realized by computer program instructions. These computer program instructions may be provided to a general purpose computer, special purpose computer, embedded processor, or processor of other programmable data processing equipment to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing equipment produce a An apparatus for realizing the functions specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a specific manner, such that the instructions stored in the computer-readable memory produce an article of manufacture comprising instruction means, the instructions The device realizes the function specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

While preferred embodiments of the invention have been described, additional changes and modifications to these embodiments can be made by those skilled in the art once the basic inventive concept is appreciated. Therefore, it is intended that the appended claims be construed to cover the preferred embodiment as well as all changes and modifications which fall within the scope of the invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of this application and their equivalent technologies, the present invention also intends to include these modifications and variations.

Claims

A block confirmation method is characterized in that it is applicable to a block chain network with m block chain nodes, and the method comprises:

For any transaction, the client determines k blockchain nodes from the m blockchain nodes as priority nodes;

The client generates a first confusion factor based on the public keys of the k priority nodes;

The client generates a first priority commitment based on the first confusion factor and the transaction;

The client generates a first priority transaction based on the first priority commitment and a hash value of the transaction, and sends the first priority transaction to the blockchain network.
The method according to claim 1, wherein the client generates a first confusion factor based on the public keys of k priority nodes, comprising:

When the client determines that the number k of priority nodes is 2, the public keys of the k priority nodes are generated through a bilinear mapping algorithm to generate the first confusion factor;

The client generates a first priority transaction based on the first priority commitment and the hash value of the transaction, including:

The client performs a hash operation on the transaction to generate a hash value of the transaction;

The client generates the first priority transaction according to the first priority commitment and the hash value of the transaction.
The method according to claim 1, wherein the client generates a first confusion factor based on the public keys of k priority nodes, comprising:

When determining that the number k of priority nodes is 1, the client determines a first priority placeholder based on an elliptic curve, and passes the first priority placeholder and the public keys of the k priority nodes through a double line A property mapping algorithm that generates the first confusion factor;

The client generates a first priority transaction based on the first priority commitment and the hash value of the transaction, including:

The client performs a hash operation on the transaction to generate a hash value of the transaction;

The client generates the first priority transaction according to the first priority commitment, the first priority placeholder, and the hash value of the transaction.
The method of claim 1, further comprising:

When the client determines that the number k of priority nodes is 0, it determines two unequal second priority placeholders and third priority placeholders based on elliptic curves, and uses the second priority placeholder and the third priority placeholder The third priority placeholder generates a second confusion factor through a bilinear mapping algorithm;

The client generates a second priority commitment based on the second confusion factor and the transaction;

The client generates a second priority transaction according to the second priority commitment, the second priority placeholder, the third priority placeholder, and the hash value of the transaction, and sends the second priority Priority transactions are sent to the blockchain network.
The method according to any one of claims 1 to 3, wherein the client generates a first priority commitment based on the first confusion factor and the transaction, including:

The client uses the first confusion factor and the transaction to generate a first priority commitment through an elliptic curve dot field multiplication algorithm.
A block confirmation method is characterized in that it is applicable to a block chain network with m block chain nodes, and the method comprises:

For any one of the m blockchain nodes, when the blockchain node detects the first priority transaction, it generates a first decrypted segment based on the private key of the blockchain node; The first priority transaction is generated by the client based on the first priority commitment and the hash value of the transaction; the first priority commitment is generated by the client based on the first confusion factor and the transaction; the first The confusion factor is generated by the client based on the public keys of the k priority nodes determined by the client from the m blockchain nodes;

The blockchain node generates a first decrypted transaction according to the first decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm;

When the block chain node determines that the hash value of the first decrypted transaction is equal to the hash value of the transaction in the first priority transaction, it packs the first decrypted transaction into a block and uploads it to the chain.
The method according to claim 6, wherein, when the blockchain node detects the first priority transaction, generating a first decrypted segment based on the private key of the blockchain node, comprising:

When the block chain node indicates that k is 2 through the number of elements contained in the first priority transaction, the private key of the block chain node is generated through a number field inversion algorithm to generate a first decryption private key;

The block chain node obtains the public keys of the m block chain nodes from the block chain, and for the public key of any block chain node, according to the first decryption private key and the block chain The public key of the node is used to generate the first decrypted fragment.
The method according to claim 6, wherein, when the blockchain node detects the first priority transaction, generating a first decrypted segment based on the private key of the blockchain node, comprising:

When the block chain node indicates that k is 1 through the number of elements contained in the first priority transaction, the private key of the block chain node is generated through a number field inversion algorithm to generate a first decryption private key;

The blockchain node obtains a first priority placeholder from the first priority transaction, and generates the first decryption segment according to the first decryption private key and the first priority placeholder.
The method of claim 6, further comprising:

When the blockchain node detects the second priority transaction, it obtains two unequal second priority placeholders and third priority placeholders from the second priority transaction; The number of elements included indicates that k is 0;

The block chain node generates a second decryption fragment according to the second priority placeholder and the third priority placeholder;

The blockchain node generates a second decrypted transaction according to the second decrypted fragment and the second priority commitment in the second priority transaction through a bilinear mapping algorithm;

When the block chain node determines that the hash value of the second decrypted transaction is equal to the hash value of the transaction in the second priority transaction, it packs the second decrypted transaction into a block and uploads it to the chain.
The method of claim 6, further comprising:

When the block chain node determines that the hash values of the first decrypted transactions corresponding to the m block chain nodes are not equal to the hash values of the transactions in the first priority transaction, from the block chain Obtain the public keys of m block chain nodes, and for the public key of any block chain node, use the public key of the block chain node through the number field inversion algorithm to generate the first decryption public key;

The block chain node generates a third decrypted segment based on the first decrypted public key;

The blockchain node generates a third decrypted transaction according to the third decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm;

When the block chain node determines that the hash value of the third decrypted transaction is equal to the hash value of the transaction in the first priority transaction, it packs the third decrypted transaction into a block and uploads it to the chain.
A block confirmation device is characterized in that it is suitable for a block chain network with m block chain nodes, and the device includes:

A determining unit is used for determining k blockchain nodes from the m blockchain nodes as priority nodes for any transaction;

The first processing unit is configured to generate a first confusion factor based on the public keys of k priority nodes; generate a first priority commitment based on the first confusion factor and the transaction; and generate a first priority commitment based on the first priority commitment and the The hash value of the transaction generates a first priority transaction, and sends the first priority transaction to the blockchain network.
A block confirmation device is characterized in that it is suitable for a block chain network with m block chain nodes, and the device includes:

A generating unit, configured to generate a first decrypted segment based on the private key of the blockchain node when a first priority transaction is detected for any one of the m blockchain nodes; The first priority transaction is generated by the client based on the first priority commitment and the hash value of the transaction; the first priority commitment is generated by the client based on the first confusion factor and the transaction; the first confusion The factor is generated by the client based on the public keys of k priority nodes determined by the client from the m blockchain nodes;

The second processing unit is configured to generate a first decrypted transaction according to the first decrypted fragment and the first priority commitment in the first priority transaction through a bilinear mapping algorithm; when determining the first decrypted transaction When the hash value of is equal to the hash value of the transaction in the first priority transaction, the first decrypted transaction is packaged as a block and uploaded to the chain.
A computing device, characterized by comprising at least one processor and at least one memory, wherein the memory stores a computer program that, when the program is executed by the processor, causes the processor to perform claim 1 The method according to any one of claims 10 to 10.
A computer-readable storage medium, characterized in that it stores a computer program executable by a computing device, and when the program runs on the computing device, the computing device executes any one of claims 1 to 10 method as described.