WO2022267314A1

WO2022267314A1 - Data processing method and apparatus based on smart contract

Info

Publication number: WO2022267314A1
Application number: PCT/CN2021/131302
Authority: WO
Inventors: 李昊轩; 严强; 王朝阳; 廖飞强; 李辉忠; 张开翔; 范瑞彬
Original assignee: 深圳前海微众银行股份有限公司
Priority date: 2021-06-22
Filing date: 2021-11-17
Publication date: 2022-12-29
Also published as: CN113326525A; CN113326525B

Abstract

Provided in the embodiments of the present invention are a data processing method and apparatus based on a smart contract. The method comprises: for any blockchain node, when it is determined that a decryption timestamp in a smart contract is satisfied, generating index ciphertext on the basis of public and private keys of the blockchain node; determining, from encrypted information, a first ciphertext fragment matching the index ciphertext and a second ciphertext fragment matching the index ciphertext; processing, by means of bilinear mapping, the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext, so as to obtain a verification fragment of the blockchain node, and uploading the verification fragment to the smart contract; and after it is verified that m verification fragments meet a set requirement, decrypting the second ciphertext fragment matching the index ciphertext, so as to obtain data to be encrypted. In this way, by means of the solution, since each blockchain node performs, by using different public and private keys instead of the same public and private keys, encryption and decryption operations on data to be encrypted, the privacy security of said data can be ensured.

Description

A data processing method and device based on smart contracts

Cross References to Related Applications

This application claims the priority of the Chinese patent application submitted to the China Patent Office on June 22, 2021, with the application number 202110692736.X and the application name "A Data Processing Method and Device Based on Smart Contract", the entire content of which is passed References are incorporated in this application.

technical field

Embodiments of the present invention relate to the field of financial technology (Fintech), and in particular to a data processing method and device based on smart contracts.

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. In the financial field, in order to prevent sensitive information contained in financial business data from being leaked, the security requirements for sensitive information in financial business data will also become higher. On this basis, the application of encryption and decryption of financial business data in financial business has also become extensive. Therefore, how to encrypt and decrypt financial service data in a timely and effective manner to meet the security requirements of financial service data has become an urgent problem to be solved.

In order to ensure that the intermediate results of each participant in the alliance chain system are the same during the encryption and decryption process, the existing scheme usually requires each participant to determine a pair of keys (that is, a public key and a private key) through mutual negotiation, that is, through key initialization The operation generates the same key, and then each participant uses the same key to encrypt and decrypt data. Specifically, after the user uses the terminal device to upload the data to each participant in the alliance chain system, each participant uses the public key to encrypt the data, and uploads the encrypted data to the blockchain, and then each participant The party uses the private key to decrypt the encrypted data uploaded by other parties to determine whether the data received by other parties is the same as the data received by itself, and after all parties have successfully verified a consensus, the data will be Up chain operation. However, in this scheme, since each participant uses the same public and private keys for encryption and decryption operations, the privacy security of the data cannot be guaranteed, and each encryption and decryption operation needs to be re-initialized to generate public and private keys. The process of encryption and decryption operations is cumbersome, and the cost of encryption and decryption operations increases.

To sum up, there is an urgent need for a data processing method based on smart contracts to solve the problem in the existing technology that all participants use the same public and private keys for encryption and decryption operations, resulting in data privacy security that cannot be guaranteed.

Contents of the invention

The embodiment of the present invention provides a data processing method and device based on a smart contract to solve the problem in the prior art that all participants use the same public and private keys for encryption and decryption operations, resulting in that the privacy and security of data cannot be fully guaranteed The problem.

In the first aspect, the embodiment of the present invention provides a data processing method based on a smart contract, which is suitable for an alliance chain with m blockchain nodes, and the method includes:

For any blockchain node, when the blockchain node determines that the decryption timestamp in the smart contract is met, an index ciphertext is generated based on the public and private keys of the blockchain node; the decryption timestamp is generated by the client is used to indicate the time to decrypt the encrypted information uploaded by the client to the smart contract; the encrypted information includes the first ciphertext fragment and the second ciphertext fragment for each blockchain node ; The first ciphertext fragment is generated by the client based on the public and private keys of the blockchain nodes; the second ciphertext fragment is generated by the client based on the data to be encrypted;

The blockchain node determines from the encrypted information a first ciphertext fragment matching the index ciphertext and a second ciphertext fragment matching the index ciphertext;

The block chain node processes the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext through bilinear mapping to obtain the block The verification fragment of the chain node, and upload the verification fragment to the smart contract;

After verifying that the m verification fragments meet the set requirements, the blockchain node decrypts the second ciphertext fragment matching the index ciphertext to obtain the data to be encrypted.

In the above technical solution, for any blockchain node, when it is determined that the local time stamp meets the decryption time stamp in the smart contract, the decryption operation can be started. That is, the index ciphertext is generated based on the public and private keys of the blockchain nodes, and based on the index ciphertext, the first ciphertext score that matches the index ciphertext can be determined in a timely and accurate manner from the encrypted information uploaded by the client to the smart contract. slice and a second ciphertext slice that matches the index ciphertext. Then, through bilinear mapping, the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext are processed to obtain the verification fragment of the blockchain node, and verify After the m verification fragments meet the set requirements, the second ciphertext fragment matching the index ciphertext is decrypted to obtain the data to be encrypted. In this way, since the scheme does not require blockchain nodes to perform encryption operations on the data to be encrypted, and each blockchain node uses different public and private keys instead of using the same public and private keys, it can ensure the privacy and security of the data to be encrypted. In addition, since this scheme does not need to re-initialize the key to generate public and private keys every time the decryption operation is performed, but always uses the public and private keys of each blockchain node, it can make the decryption process of the scheme simpler and more convenient , so that the cost of the decryption operation can be reduced.

Optionally, the index ciphertext is generated based on the public and private keys of the blockchain nodes, including:

The block chain node splices the private key of the block chain node with the encryption index of the current round to generate an offset message;

The blockchain node performs a hash operation on the offset message to generate an encrypted offset factor;

The blockchain node generates the index ciphertext based on the encryption offset factor and the public key of the blockchain node.

In the above technical solution, the offset message is generated based on the private key of each blockchain node and the current round of encryption index, and the index ciphertext is generated based on the offset message and the public key of each blockchain node, which can be Each blockchain node timely and accurately determines the first ciphertext fragment and the second ciphertext fragment matching the index ciphertext of the blockchain node from the smart contract based on the index ciphertext generated by itself to provide support.

Optionally, the blockchain node processes the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext through bilinear mapping, to obtain The verification fragmentation of the blockchain node includes:

The blockchain node acquires the first commitment fragments of m blockchain nodes from the smart contract; the first commitment fragments are generated by the blockchain nodes based on their respective encryption offset factors;

The blockchain node uses the bilinear mapping to encrypt the offset factor of the blockchain node, the first ciphertext fragment matching the index ciphertext, and the first ciphertext fragment matching the index ciphertext. The second ciphertext fragment, the first commitment fragment of the blockchain node, and the private key of the blockchain node are converted to generate a verification fragment of the blockchain node.

In the above technical solution, through bilinear mapping, the encrypted offset factor of the blockchain node, the first ciphertext fragment matching the index ciphertext, the second ciphertext fragment matching the index ciphertext, and the block The first commitment fragment of the chain node and the private key of the blockchain node are converted to generate verification fragments in a timely and accurate manner. The verification fragment can provide support for subsequent decryption of the data to be encrypted.

Optionally, the blockchain node verifies that the m verification fragments meet the set requirements, including:

The block chain node determines whether the verification fragmentation of the block chain node is the same as the verification fragmentation of other block chain nodes except the block chain node;

If yes, the block chain node confirms that the verification of the m verification fragments is successful.

In the above technical solution, any blockchain node completes the consensus synchronization process for the verification fragment by determining whether its own verification fragment is the same as that of other blockchain nodes other than the blockchain node. And after confirming that each block chain node is successfully verified, it can be confirmed that each block chain node can obtain the same intermediate result (ie verification fragmentation) even if it uses a different private key to decrypt, without using the same block chain node. private key.

Optionally, after the block chain node confirms that the verification of the m verification fragments is successful, it also includes:

The blockchain node uploads the encrypted offset factor of the blockchain node to the smart contract;

Decrypting the second ciphertext segment matching the index ciphertext to obtain the data to be encrypted, including:

The blockchain node obtains the encrypted offset factors of the m blockchain nodes from the smart contract;

The blockchain node decrypts the second ciphertext fragment matching the index ciphertext based on the encryption offset factors of the m blockchain nodes through the bilinear mapping, and obtains the Data to be encrypted.

In the above technical solution, each blockchain node uploads its own encryption offset factor to the smart contract, which can provide any blockchain node with the ability to decrypt the second ciphertext fragment matching the index ciphertext through bilinear mapping. Data support, so that the data to be encrypted can be decrypted in a timely and effective manner.

Optionally, after obtaining the data to be encrypted, it also includes:

Each block chain node in other block chain nodes except the block chain node obtains the data to be encrypted decrypted by the block chain node and the encryption bias of the m block chain nodes from the smart contract shift factor; the data to be encrypted is uploaded to the smart contract by the block chain node;

Each block chain node in the other block chain nodes decrypts the data to be encrypted by the block chain nodes based on the encryption offset factors of the m block chain nodes through the bilinear mapping Verification is performed to determine the matching between the data to be encrypted and the verification segment, so as to determine whether the decrypted data to be encrypted is correct.

In the above technical solution, after any blockchain node decrypts the data to be encrypted, each blockchain node in other blockchain nodes except the blockchain node verifies the correctness of the decrypted data to be encrypted , so that after confirming that each blockchain node has reached a consensus on the decrypted data to be encrypted, it is confirmed that the decrypted data to be encrypted is correct, and the decrypted data to be encrypted is recorded in the blockchain.

In the second aspect, the embodiment of the present invention provides a data processing method based on a smart contract, which is suitable for an alliance chain with m blockchain nodes, and the method includes:

The client obtains the first commitment fragment of the m blockchain nodes from the smart contract, and obtains the encrypted offset factors of the m blockchain nodes through a secret communication channel; the first commitment fragment is a block Chain nodes are generated based on their respective encrypted offset factors; the encrypted offset factors are generated by blockchain nodes based on their respective private keys;

For each block chain node, the client generates the first ciphertext fragment based on the encryption offset factor of the block chain node and the public key of the block chain node, and based on the data to be encrypted and the The first commitment fragment of other blockchain nodes other than the blockchain node generates a second ciphertext fragment;

The client generates a decryption timestamp;

The client uploads the decrypted timestamp and the first ciphertext fragment and the second ciphertext fragment of the m blockchain nodes to the smart contract; the decrypted timestamp is used to indicate any The blockchain node decrypts the first ciphertext fragment and the second ciphertext fragment in the smart contract when determining that the local timestamp satisfies the decryption timestamp.

In the above technical solution, for each block chain node, the first ciphertext fragment is generated based on the encryption offset factor of the block chain node and the public key of the block chain node, and based on the data to be encrypted and the The second ciphertext fragments are generated from the first commitment fragments of other blockchain nodes other than the blockchain node. Then generate a decryption timestamp, and upload the decryption timestamp and the first ciphertext fragment and the second ciphertext fragment of the m blockchain nodes to the smart contract. In this way, the scheme uses the client to encrypt the data to be encrypted based on the public and private keys of each blockchain node, and generates the first ciphertext fragment and the second ciphertext fragment without using the same public and private keys for each blockchain node Encryption processing is performed to ensure the privacy and security of the data to be encrypted. In addition, this scheme does not require each blockchain node to re-initialize the key to generate a public-private key every time the encryption operation is performed, but always uses the public-private key of each blockchain node, so the encryption operation process of the scheme can be made more efficient. It is simple and convenient, so that the cost of the encryption operation can be reduced.

Optionally, before generating the first ciphertext fragment, it also includes:

For each blockchain node, the client generates a second commitment fragment of the blockchain node based on the encryption offset factor of the blockchain node;

The client determines whether the first commitment fragments of the m blockchain nodes and the second commitment fragments of the m blockchain nodes are all corresponding to the same;

If yes, the client confirms that the verification of the first committed fragment of the m blockchain nodes is successful.

In the above technical solution, in order for the client to obtain accurate fragments of commitments of each blockchain node from the smart contract, in order to verify the accuracy of the commitments of each blockchain node, it is based on The encrypted offset factor of the blockchain node regenerates the commitment fragment of each blockchain node for verification, so as to ensure the security of the ciphertext fragment generated by encrypting the data to be encrypted based on the commitment fragment of each blockchain node and accuracy.

In the third aspect, the embodiment of the present invention provides a data processing device based on a smart contract, which is suitable for a consortium chain with m blockchain nodes, and the device includes:

The generation unit is used to generate index ciphertext based on the public and private keys of the blockchain node when it is determined that the decryption timestamp in the smart contract is met for any blockchain node; the decryption timestamp is generated by the client Used to indicate the time to decrypt the encrypted information uploaded by the client to the smart contract; the encrypted information includes a first ciphertext fragment and a second ciphertext fragment for each blockchain node; The first ciphertext fragment is generated by the client based on the public and private keys of the blockchain nodes; the second ciphertext fragment is generated by the client based on the data to be encrypted;

A first processing unit, configured to determine from the encrypted information a first ciphertext segment matching the index ciphertext and a second ciphertext segment matching the index ciphertext; through bilinear mapping , process the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext to obtain the verification fragment of the blockchain node, and the The verification fragments are uploaded to the smart contract; after verifying that the m verification fragments meet the set requirements, decrypt the second ciphertext fragments matching the index ciphertext to obtain the data to be encrypted.

Optionally, the generating unit is specifically used for:

Splicing the private key of the blockchain node with the encryption index of the current round to generate an offset message;

performing a hash operation on the offset message to generate an encrypted offset factor;

The index ciphertext is generated based on the encryption offset factor and the public key of the blockchain node.

Optionally, the first processing unit is specifically configured to:

Obtain the first commitment shards of m blockchain nodes from the smart contract; the first commitment shards are generated by the blockchain nodes based on their respective encryption offset factors;

Through the bilinear mapping, the encryption offset factor of the blockchain node, the first ciphertext fragment matching the index ciphertext, and the second ciphertext fragment matching the index ciphertext , performing conversion processing on the first commitment fragment of the blockchain node and the private key of the blockchain node to generate a verification fragment of the blockchain node.

Optionally, the first processing unit is specifically configured to:

Determine whether the verification fragmentation of the blockchain node is the same as the verification fragmentation of other blockchain nodes except the blockchain node;

If yes, confirm that the m verification fragments are successfully verified.

Optionally, the first processing unit is also used for:

After confirming that the verification of the m verification fragments is successful, upload the encryption offset factor of the blockchain node to the smart contract;

The first processing unit is specifically used for:

Obtain the encrypted offset factors of the m blockchain nodes from the smart contract;

Through the bilinear mapping, based on the encryption offset factors of the m blockchain nodes, the second ciphertext fragment matching the index ciphertext is decrypted to obtain the data to be encrypted.

Optionally, the first processing unit is also used for:

After obtaining the data to be encrypted, obtain the data to be encrypted decrypted by the block chain node and the encryption offset factors of the m block chain nodes from the smart contract; the data to be encrypted is the area The block chain node uploads to the smart contract;

Through the bilinear mapping, based on the encryption offset factors of the m blockchain nodes, verify the data to be encrypted decrypted by the blockchain nodes, and determine the relationship between the data to be encrypted and the verification segment matching, so as to determine whether the decrypted data to be encrypted is correct.

In the fourth aspect, the embodiment of the present invention provides a data processing device based on a smart contract, which is suitable for a consortium chain with m blockchain nodes, and the device includes:

An acquisition unit, configured to acquire the first commitment fragments of the m blockchain nodes from the smart contract, and acquire the encrypted offset factors of the m blockchain nodes through a secret communication channel; the first commitment fragments are generated by blockchain nodes based on their respective encrypted offset factors; the encrypted offset factors are generated by blockchain nodes based on their respective private keys;

The second processing unit is configured to, for each block chain node, generate a first ciphertext fragment based on the encryption offset factor of the block chain node and the public key of the block chain node, and based on the Data and the first commitment fragments of other blockchain nodes except the blockchain node, generate a second ciphertext fragment; generate a decryption timestamp; combine the decryption timestamp and the m blockchain nodes The first ciphertext fragment and the second ciphertext fragment of the node are uploaded to the smart contract; the decryption timestamp is used to indicate that any block chain node determines that the local timestamp satisfies the decryption timestamp The first ciphertext fragment and the second ciphertext fragment in the smart contract are decrypted.

Optionally, the second processing unit is also used for:

Before generating the first ciphertext fragment, for each blockchain node, based on the encryption offset factor of the blockchain node, generate the second commitment fragment of the blockchain node;

Determine whether the first committed fragments of the m blockchain nodes and the second committed fragments of the m blockchain nodes are all corresponding to the same;

If yes, then confirm that the verification of the first committed shards of the m blockchain nodes is successful.

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 smart contract-based data processing method described in any of the first or second aspects above.

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 The smart contract-based data processing method described in any aspect or the second aspect.

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 data processing method based on a smart contract provided by an embodiment of the present invention;

FIG. 2 is a schematic structural diagram of a data processing device based on a smart contract provided by an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of another smart contract-based data processing 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 description

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) Node: Every participant in the network is a node, and the node participates in network formation and data exchange. In the blockchain network, a node refers to a participant with a unique identity. The node has a complete copy of the ledger and has the ability to participate in the blockchain network consensus and ledger maintenance.

(4) Consortium chain: refers to a blockchain that is jointly managed by several institutions or organizations, each of which runs one or more nodes, and the data in it only allows different institutions in the system to read and send transactions, and Co-record transaction data. Each node of the consortium chain usually has a corresponding entity organization, which can only join and exit the network after authorization; each organization forms a stake-related alliance to jointly maintain the healthy operation of the blockchain.

(5) Bilinear mapping: For any a,b∈Z _p ^* , e(aR,bS)=e(R,S) ^ab holds, and R and S are any points of G ₁ . Assume that G ₁ is an additive cyclic group with generator P and its order is p, G ₂ is a multiplicative cyclic group with the same order as G ₁ , and a, b are elements in Z _p ^* (prime cyclic group of order p).

(6) Smart contract: A smart contract is a collection of code and data running on the blockchain system, in which the code is responsible for realizing the functions of the smart contract, the data is responsible for storing the state of the smart contract, and the smart contract can receive and send information.

Part 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 data processing method based on a smart contract provided by an embodiment of the present invention, and the flow can be executed by a data processing device based on a smart contract. Wherein, the smart contract-based data processing method is applicable to a consortium chain with m blockchain nodes.

As shown in Figure 1, the process specifically includes:

Step 101, for each blockchain node, the blockchain node generates a first commitment fragment based on its encrypted offset factor, and uploads the first commitment fragment to the smart contract.

Step 102, the client obtains the first committed fragments of the m blockchain nodes from the smart contract, and obtains the encrypted offset factors of the m blockchain nodes through a secret communication channel.

Step 103, for each block chain node, the client generates a first ciphertext fragment based on the encryption offset factor of the block chain node and the public key of the block chain node, and based on the The data and the first commitment fragments of other blockchain nodes except the blockchain node generate second ciphertext fragments and decryption timestamps.

Step 104, the client uploads the decrypted timestamp and the first ciphertext fragment and the second ciphertext fragment of the m blockchain nodes to the smart contract.

Step 105, for any block chain node, when the block chain node determines that the decryption timestamp in the smart contract is satisfied, an index ciphertext is generated based on the public and private keys of the block chain node.

Step 106, the blockchain node determines from the encrypted information a first ciphertext segment matching the index ciphertext and a second ciphertext segment matching the index ciphertext.

Step 107, the block chain node processes the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext through bilinear mapping to obtain the The verification fragment of the blockchain node is uploaded to the smart contract.

Step 108, after verifying that the m verification fragments meet the set requirements, the blockchain node decrypts the second ciphertext fragment matching the index ciphertext to obtain the data to be encrypted.

In the above step 101, for each blockchain node in the consortium chain, the blockchain node splices its own private key and the offset factor of the current round of encryption, generates an offset message, and uses the message digest algorithm or secure hash Hash operation on the offset message by column algorithm to generate the encrypted offset factor of the blockchain node, and then generate the first commitment score of the blockchain node through the encrypted offset factor and the public point on the elliptic curve piece, and upload the first commitment piece to the smart contract, so that each blockchain node in the alliance chain uploads the first commitment piece generated by itself to the smart contract. Exemplarily, suppose there are three blockchain nodes in the alliance chain, namely, blockchain node 1, blockchain node 2, and blockchain node 3. Taking blockchain node 1 in the alliance chain as an example, the blockchain Node 1 concatenates its own private key sk ₁ with the current encryption index index to generate an offset message (sk ₁ |index). Then hash the offset message through a message digest algorithm or a secure hash algorithm to generate the encrypted offset factor of blockchain node 1, that is, the encrypted offset factor r ₁ =H(sk ₁ |index). Then, multiply its own encrypted offset factor r ₁ with the public point G on the elliptic curve to generate the first commitment fragment of blockchain node 1, that is, the first commitment fragment R ₁ =r ₁ *G.

In the above step 102, when the user needs to encrypt the data to be encrypted, the user sends the first commitment fragment acquisition request to any blockchain node in the alliance chain through the client, and the first commitment fragment acquisition request is used to acquire m The first committed shard of a blockchain node. After the blockchain node receives the request for obtaining the first commitment fragment, it reads the first commitment fragments of each blockchain node from the smart contract, and then sends the first commitment fragments of the m blockchain nodes to the client end. At the same time, the user uses the client to send an encrypted offset factor acquisition request to m blockchain nodes through a secret communication channel. Each blockchain node sends its encrypted offset factor to the client after receiving the encrypted offset factor acquisition request. After the client receives the first committed fragment and encrypted offset factor of m blockchain nodes, for each blockchain node, the client generates the block based on the encrypted offset factor of the blockchain node The second commitment fragment of the chain node, that is, the encrypted offset factor of the blockchain node and the public point on the elliptic curve, generates the second commitment fragment of the blockchain node. Then, determine whether the first commitment fragments of the m blockchain nodes and the second commitment fragments of the m blockchain nodes are all corresponding to the same, if so, confirm the verification of the first commitment fragments of the m blockchain nodes success. In this way, in order for the client to obtain accurate fragments of the commitment of each blockchain node from the smart contract, in order to verify the accuracy of the commitment of each blockchain node, it will be based on the The encryption offset factor of each blockchain node regenerates the commitment fragments of each blockchain node for verification, so as to ensure the security and accuracy of the ciphertext fragments generated by encrypting the data to be encrypted based on the commitment fragments of each blockchain node . Exemplarily, taking blockchain node 1 in the consortium chain as an example, for blockchain node 1, the user compares the encryption offset factor r ₁ of blockchain node 1 with the public point G on the elliptic curve through the client Multiplied together, an offset verification commitment R ₁ ′=r ₁ *G for blockchain node 1 is generated. Then, the user verifies whether the locally generated offset verification commitment R ₁ ′ of the blockchain node 1 is equal to the offset commitment R ₁ of the blockchain node 1 obtained from the smart contract through the client.

In the above step 103 and step 104, for each blockchain node, the client generates the first ciphertext fragment based on the encrypted offset factor of the blockchain node and the public key of the blockchain node, and based on the Encrypt the data and the first commitment fragment of other blockchain nodes except the blockchain node, generate the second ciphertext fragment, and generate the decryption timestamp, and then decrypt the timestamp and the first m blockchain nodes The first ciphertext fragment and the second ciphertext fragment are uploaded to the smart contract. Wherein, the decryption timestamp is used to instruct any blockchain node to decrypt the first ciphertext fragment and the second ciphertext fragment in the smart contract when determining that the local timestamp satisfies the decryption timestamp. Exemplarily, taking the blockchain node 1 in the consortium chain as an example, for the blockchain node 1, the user uses the client to encrypt the encryption offset factor r ₁ of the blockchain node 1 and the public key of the blockchain node 1 pk ₁ is multiplied to generate the first ciphertext fragment for blockchain node 1, that is, the first ciphertext fragment Q ₁ =r ₁ *pk ₁ . The user processes the encrypted data m and the offset commitments of other blockchain nodes except blockchain node A through the client, and generates the second ciphertext fragment for blockchain node 1, that is, the second ciphertext fragment Slice T ₁ =m*G+R ₂ +R ₃ .

In the above step 105 and step 106, for any blockchain node, when the blockchain node determines that the local timestamp meets the decrypted timestamp in the smart contract, that is, the blockchain node determines that the local timestamp is greater than or equal to the smart When the decryption timestamp in the contract is entered, the decryption operation process starts. Specifically, the blockchain node splices the private key of the blockchain node with the encryption index of the current round to generate an offset message, and performs a hash operation on the offset message to generate an encrypted offset factor, and then based on the encrypted offset factor And the public key of the blockchain node to generate index ciphertext. Exemplarily, taking the blockchain node 1 in the consortium chain as an example, for the blockchain node 1, the blockchain node 1 compares its encryption offset factor r ₁ with the public key pk ₁ of the blockchain node 1 The multiplication process generates index ciphertext for blockchain node 1, that is, index ciphertext S ₁ =r ₁ *pk ₁ . In this way, the first ciphertext fragment and the second ciphertext fragment matching the index ciphertext of the blockchain node can be determined from the smart contract for each blockchain node in a timely and accurate manner based on the index ciphertext generated by itself provide support. Then, based on the index ciphertext generated by itself, the block chain node determines the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext from the encrypted information. Wherein, the encrypted information includes a first ciphertext fragment and a second ciphertext fragment for each block chain node.

In the above step 107 and step 108, for any blockchain node, the blockchain node obtains the first commitment fragments of m blockchain nodes from the smart contract, and through bilinear mapping, the blockchain node The encrypted offset factor of , the first ciphertext fragment matching the index ciphertext, the second ciphertext fragment matching the index ciphertext, the first commitment shard of the blockchain node, and the private key of the blockchain node Through the conversion process, the verification fragment of the blockchain node can be generated in a timely and accurate manner, and the verification fragment can be uploaded to the smart contract to provide support for subsequent decryption of the data to be encrypted. Then, after confirming that all m blockchain nodes have uploaded the verification fragments generated by themselves to the smart contract, it is determined that the verification fragments of the blockchain node and the verification fragments of other blockchain nodes except the blockchain node Whether the shards are the same, if so, confirm that m verification shards are successfully verified. In this way, any blockchain node completes the consensus synchronization process for the verification shard by determining whether its own verification shard is the same as that of other blockchain nodes except the blockchain node. And after confirming that each block chain node is successfully verified, it can be confirmed that each block chain node can obtain the same intermediate result (ie verification fragmentation) even if it uses a different private key to decrypt, without using the same block chain node. private key. After confirming that m verification fragments are successfully verified, the blockchain node uploads the encryption offset factor of the blockchain node to the smart contract, so that m blockchain nodes will upload their own encryption offset factors to the smart contract contract. Then, any blockchain node obtains the encrypted offset factors of m blockchain nodes from the smart contract, and through bilinear mapping, based on the encrypted offset factors of m blockchain nodes, the pair matches with the index ciphertext Decrypt the second ciphertext fragment to obtain the data to be encrypted, and upload the data to be encrypted to the smart contract.

Exemplarily, taking the blockchain node 2 that satisfies the decryption condition as an example, the blockchain node 2 can traverse in sequence according to the value range of binary numbers from small to large or from large to small, and based on verification fragmentation, through double Linear mapping, to determine whether each traversed data m _i satisfies

Among them, the right side of the equation is a verification slice, which is also a value. If it is determined that a certain data m _i satisfies, the data m _i will be used as the decrypted data, and the decrypted data will be uploaded to the smart contract.

After obtaining the data to be encrypted, each blockchain node in other blockchain nodes except the blockchain node obtains the data to be encrypted decrypted by the blockchain node and m blockchain nodes from the smart contract The encryption offset factor of , and through bilinear mapping, based on the encryption offset factors of m blockchain nodes, verify the data to be encrypted decrypted by the blockchain node, and determine the matching between the data to be encrypted and the verification segment In order to verify whether the decrypted data to be encrypted is correct, so that after confirming that each blockchain node has reached a consensus on the decrypted data to be encrypted, it is confirmed that the decrypted data to be encrypted is correct, and the decrypted The data to be encrypted is recorded to the blockchain.

Exemplarily, taking the block chain node 2 that has decrypted the data to be encrypted as an example, other block chain nodes obtain the data m _i to be encrypted decrypted by the block chain node 2 from the smart contract. For example, the blockchain node 1 obtains the decrypted data mi to be encrypted from the smart contract, and verifies the matching between the data _mi decrypted by the _blockchain node 1 and the verification slice through the bilinear mapping algorithm. That is, verify that

If it is satisfied, the block chain node 1 confirms that the data mi to be encrypted _decrypted by the block chain node 2 is correct. Similarly, other blockchain nodes can also verify whether the data mi to be encrypted decrypted by _blockchain node 2 is correct in the same verification method as blockchain node 1, and details will not be repeated here.

Based on this, the implementation process of the smart contract-based data processing method in the embodiment of the present invention will be described in detail below by taking the application scenario as an alliance chain as an example.

Step1: Each blockchain node in the consortium chain generates its own offset commitment.

Specifically, when the user encrypts the data to be encrypted, it is necessary to obtain the offset commitment of each blockchain node through any blockchain node in the consortium chain to encrypt the data to be encrypted. Based on this, before the user encrypts the data to be encrypted, each blockchain node in the consortium chain will pre-generate its own offset commitment.

The specific implementation process of generating offset commitments for each blockchain node is described below.

Step a. For each blockchain node, the blockchain node generates an encryption offset factor for the blockchain node based on its own private key and the current round of encryption index.

Specifically, take the example that the alliance chain is composed of four blockchain nodes, namely, blockchain node A, blockchain node B, blockchain node C, and blockchain node D. Blockchain node A splices its own private key sk _A with the current round of encrypted index index to generate an offset message (sk _A | index). Then hash the offset message through the message digest algorithm or secure hash algorithm to generate the encryption offset factor of blockchain node A, that is, the encryption offset factor r _A = H(sk _A | index). Blockchain node B splices its own private key sk _B with the current round of encrypted index index to generate an offset message (sk _B |index). Then hash the offset message through a message digest algorithm or a secure hash algorithm to generate the encryption offset factor of the blockchain node B, that is, the encryption offset factor r _B = H(sk _B |index). Blockchain node C splices its own private key sk _C with the current round of encrypted index index to generate an offset message (sk _C |index). Then hash the offset message through the message digest algorithm or secure hash algorithm to generate the encryption offset factor of the blockchain node C, that is, the encryption offset factor r _C =H(sk _C |index). Blockchain node D splices its own private key sk _D with the current round of encrypted index index to generate an offset message (sk _D | index). Then hash the offset message through the message digest algorithm or secure hash algorithm to generate the encryption offset factor of the blockchain node D, that is, the encryption offset factor r _D =H(sk _D |index).

Step b. Each blockchain node generates an offset commitment for the blockchain node based on its encrypted offset factor and the public point on the elliptic curve.

Specifically, each blockchain node multiplies its encrypted offset factor with the public point G on the elliptic curve to generate the offset commitment of the blockchain node, that is, the offset commitment R _x = r _x *G . Continuing to take the above-mentioned consortium chain consisting of four blockchain nodes as an example, blockchain node A multiplies its encrypted offset factor r _A with the public point G on the elliptic curve to generate the bias of blockchain node A shift commitment, that is, the shift commitment R _A =r _A *G. Blockchain node B multiplies its encryption offset factor r _B with the public point G on the elliptic curve to generate an offset commitment of blockchain node B, that is, offset commitment R _B =r _B *G. Blockchain node C multiplies its encrypted offset factor r _C with the public point G on the elliptic curve to generate an offset commitment of blockchain node C, that is, offset commitment R _C =r _C *G. The blockchain node D multiplies its encryption offset factor r _D with the public point G on the elliptic curve to generate the offset commitment of the blockchain node D, that is, the offset commitment R _D =r _D *G. Among them, it should be noted that the calculation result (that is, the offset commitment) obtained by multiplying the encrypted offset factor by the public point on the elliptic curve by each blockchain node is still a point on the elliptic curve.

Step c. Each blockchain node uploads its offset commitment to the smart contract.

Specifically, continue to take the above-mentioned consortium chain consisting of four blockchain nodes as an example. Blockchain node A uploads its own offset commitment R _A to the smart contract E_Contract; blockchain node B uploads its own offset commitment R _B uploads to the smart contract E_Contract; blockchain node C uploads its own offset commitment R _C to the smart contract E_Contract; blockchain node D uploads its own offset commitment R _D to the smart contract E_Contract.

In addition, each blockchain node in the consortium chain will also upload its own public key to the smart contract. That is, blockchain node A uploads its own public key pk _A to the smart contract E_Contract; blockchain node B uploads its own public key pk _B to the smart contract E_Contract; blockchain node C uploads its own public key pk _C Upload to smart contract E_Contract; blockchain node D uploads its own public key pk _D to smart contract E_Contract. A pk _list = [pk _A ,pk _B ,pk _C ,pk _D ] is formed in the smart contract E_Contract. If a new blockchain node joins the consortium chain, the pk _list will be updated synchronously. Wherein, pk _x =sk _x *G, G is a public point on the elliptic curve, for example, pk _A =sk _A *G.

Step2: The user encrypts the data to be encrypted through the client, and uploads the encrypted data to the smart contract.

Specifically, for each block chain node, the user generates the first ciphertext fragment based on the offset encryption factor and public key of the block chain node through the client, and generates the first ciphertext fragment based on other areas except the block chain node The offset commitment of the block chain node processes the data to be encrypted and generates the second ciphertext fragment. Then, the user uploads the first ciphertext fragment and the second ciphertext fragment of each blockchain node to the smart contract through the client.

The following describes the specific implementation process for the user to generate ciphertext fragments through the client.

Step a. The user sends an offset commitment acquisition request to any blockchain node in the consortium chain through the client.

Wherein, the offset commitment acquisition request is used to acquire the offset commitment of each block chain node, and the client is loaded on a terminal device, which can be a terminal device such as a tablet computer, a mobile phone, a notebook computer or a desktop computer, and the implementation of the present invention The example is not limited to this. Specifically, when a user needs to encrypt a certain data to be encrypted, he will first send an offset commitment acquisition request to any blockchain node. After receiving the offset commitment acquisition request, the blockchain node will read the offset commitments of each blockchain node from the smart contract, and package the offset commitments of each blockchain node to form a data packet, and then Send that packet to the client. After receiving the data packet, the client parses and processes the data packet to obtain the offset commitment of each blockchain node. Exemplarily, continue to take the above-mentioned consortium chain composed of four blockchain nodes as an example, for example, the user sends an offset commitment acquisition request to blockchain node A through the client. After blockchain node A receives the offset commitment acquisition request, it will read the offset commitments of blockchain node A, blockchain node B, blockchain node C, and blockchain node D from the smart contract. And package the offset commitments of these four blockchain nodes to form a data packet, and then send the data packet to the client. After receiving the data packet, the client analyzes and processes the data packet, and obtains the offset commitment R _A of the blockchain node A, the offset commitment R B of the blockchain node B, and the offset commitment R _B of the blockchain node C. The offset commitment R _C and the offset commitment R _D of the blockchain node D.

Step b. The user sends an encrypted offset factor acquisition request to each blockchain node through the client.

Wherein, the encryption offset factor acquisition request is used to acquire the encryption offset factor of each blockchain node. Specifically, based on the client, the user sends an encrypted offset factor acquisition request to each blockchain node through a dedicated communication channel or a secret communication channel. Each blockchain node sends its encrypted offset factor to the client after receiving the encrypted offset factor acquisition request. Exemplarily, continuing to take the above-mentioned consortium chain composed of four blockchain nodes as an example, the user sends an encrypted offset factor acquisition request to blockchain node A through a dedicated communication channel or a secret communication channel based on the client. Blockchain node A sends its encrypted offset factor r _A to the client after receiving the encrypted offset factor acquisition request. Based on the client, the user sends an encrypted offset factor acquisition request to the blockchain node B through a dedicated communication channel or a secret communication channel. After receiving the encryption offset factor acquisition request, blockchain node B sends its own encryption offset factor r _B to the client. Blockchain node C sends its encrypted offset factor r _C to the client after receiving the encrypted offset factor acquisition request. Blockchain node D sends its encrypted offset factor r _D to the client after receiving the encryption offset factor acquisition request.

Step c. For each blockchain node, the user generates an offset verification commitment through the client based on the encrypted offset factor of the blockchain node and the public point on the elliptic curve.

Specifically, for each blockchain node, the user multiplies the encrypted offset factor of the blockchain node with the public point on the elliptic curve through the client to generate an offset verification commitment for the blockchain node . Exemplarily, continue to take the above-mentioned consortium chain consisting of four blockchain nodes as an example. For blockchain node A, the user uses the client to compare the encrypted offset factor r _A of blockchain node A with the public data on the elliptic curve. Point G is multiplied to generate the offset verification commitment R _A ′=r _A *G for blockchain node A. For blockchain node B, the user multiplies the encrypted offset factor r _B of blockchain node B with the public point G on the elliptic curve through the client to generate an offset verification commitment R _{B for blockchain node B} '= _rB *G. For blockchain node C, the user multiplies the encrypted offset factor r _C of blockchain node C with the public point G on the elliptic curve through the client to generate an offset verification commitment R _{C for blockchain node C} '=r _C *G. For the blockchain node D, the user multiplies the encrypted offset factor r _D of the blockchain node D with the public point G on the elliptic curve through the client to generate an offset verification commitment R _{D for the blockchain node D} '= _rD *G.

Step d. For each blockchain node, the user verifies through the client whether the offset verification commitment of the blockchain node generated locally is equal to the offset commitment of the blockchain node obtained from the smart contract.

Specifically, if it is verified that the offset verification commitment of each blockchain node generated locally is equal to the offset commitment of each blockchain node obtained from the smart contract, then perform step e; if verifying a locally generated blockchain The node's offset verification commitment is not equal to the offset commitment of the blockchain node obtained from the smart contract, or the offset verification commitment of multiple blockchain nodes generated locally is not equal to the multi-block chain node's offset commitment obtained from the smart contract. If the offset commitments of two blockchain nodes do not correspond to the same, it is determined that one or more blockchain nodes are doing evil, and the encryption process can be terminated.

Exemplarily, continue to take the above-mentioned consortium chain consisting of four blockchain nodes as an example, the user verifies the locally generated blockchain node A's offset verification commitment R _A ' and the block obtained from the smart contract through the client Whether the offset commitment R _A of chain node A is equal; verify whether the offset verification commitment R _B ′ of blockchain node B generated locally is equal to the offset commitment R _B of blockchain node B obtained from the smart contract; Verify whether the offset verification commitment R _C ′ of the locally generated blockchain node C is equal to the offset commitment R _C of the blockchain node C obtained from the smart contract; and verify the offset of the locally generated blockchain node D Whether the offset verification commitment R _D ′ is equal to the offset commitment R _D of the blockchain node D obtained from the smart contract. If it is determined that the verification of these four blockchain nodes is successful, then perform step e; if it is determined that at least one of the four blockchain nodes is unsuccessful in verification, for example, the verification of blockchain node A is unsuccessful, then If it is determined that blockchain node A is evil, the encryption process can be terminated. Or if the verification of blockchain node A and blockchain node B is unsuccessful, it is determined that blockchain node A and blockchain node B are evil, and the encryption process can be terminated.

Step e. After confirming that the offset commitments of each blockchain node have been successfully verified, for each blockchain node, the user generates an encryption offset factor and public key for the block through the client through the client. The first ciphertext fragment of the chain node.

Exemplarily, continue to take the above-mentioned consortium chain consisting of four blockchain nodes as an example. For blockchain node A, the user uses the client to compare the encryption offset factor r _A of blockchain node A with blockchain node A The public key pk A of public key pk _A is multiplied to generate the first ciphertext fragment for blockchain node A, that is, the first ciphertext fragment Q _A =r _A *pk _A . For blockchain node B, the user multiplies the encryption offset factor r _B of blockchain node B with the public key pk _B of blockchain node B through the client to generate the first The ciphertext fragmentation, that is, the first ciphertext fragmentation Q _B =r _B *pk _B . For blockchain node C, the user multiplies the encryption offset factor r _C of blockchain node C with the public key pk _C of blockchain node C through the client to generate the first The ciphertext fragmentation, that is, the first ciphertext fragmentation Q _C =r _C *pk _C . For the blockchain node D, the user multiplies the encryption offset factor r _D of the blockchain node D with the public key pk _D of the blockchain node D through the client to generate the first key for the blockchain node D. The ciphertext fragmentation, that is, the first ciphertext fragmentation Q _D =r _D *pk _D .

Step f. For each blockchain node, the user generates the second ciphertext for the blockchain node through the client based on the data to be encrypted and the offset commitments of other blockchain nodes except the blockchain node Fragmentation.

Exemplarily, continue to take the above-mentioned consortium chain consisting of four blockchain nodes as an example, for blockchain node A, the user treats the encrypted data m and other blockchain nodes except blockchain node A through the client The offset commitment is processed to generate the second ciphertext fragment for blockchain node A, that is, the second ciphertext fragment T _A =m*G+R _B + _RC + _RD . For blockchain node B, the user processes the encrypted data m and the offset commitments of other blockchain nodes except blockchain node B through the client, and generates the second ciphertext fragment for blockchain node B , that is, the second ciphertext fragment T _B =m*G+ _RA +R _C + _RD . For blockchain node C, the user processes the encrypted data m and the offset commitments of other blockchain nodes except blockchain node C through the client, and generates the second ciphertext fragment for blockchain node C , that is, the second ciphertext fragment T _C =m* _G +RA +R _B + _RD . For blockchain node D, the user processes the encrypted data m and offset commitments of other blockchain nodes except blockchain node D through the client, and generates the second ciphertext fragment for blockchain node D , that is, the second ciphertext fragment T _D =m*G+ _RA + _RB + _RC .

Step g, the user sets the decryption time stamps for decrypting the first ciphertext fragment and the second ciphertext fragment through the client.

Specifically, the user sets a decryption timestamp Timestamp on the client, and the decryption timestamp is used to instruct any blockchain node to perform a decryption operation after determining that the local timestamp satisfies the decryption timestamp.

Step h, the user uploads the decryption timestamp and the first ciphertext fragment and the second ciphertext fragment of each blockchain node to the smart contract through the client.

Exemplarily, the user uploads (T _A , Q _A , T _B , Q _B , T _C , Q _C , T _D , Q _D , Timestamp) to the smart contract E_Contract through the client to complete the encryption of the data to be encrypted. cryptographic operations.

Step3: Each blockchain node decrypts the encrypted data and verifies the decrypted data.

Specifically, for each block chain node, if the block chain node determines that the decryption condition is satisfied, the decryption operation is started; if the block chain node determines that the decryption condition is not satisfied, the decryption operation is not performed. Among them, the decryption condition is that the local timestamp is greater than or equal to the decrypted timestamp in the smart contract. Exemplarily, take blockchain node A that satisfies the decryption condition as an example, if blockchain node A determines that the local timestamp is greater than or equal to the decryption timestamp in the smart contract, it starts to perform the decryption operation; if blockchain node A determines If the local timestamp is smaller than the decryption timestamp in the smart contract, the decryption operation will not be performed.

The following is a specific description of the decryption implementation process of the blockchain nodes that meet the decryption conditions.

Step a. For the blockchain node that meets the decryption condition, the blockchain node that meets the decryption condition reads the local private key, and generates an encryption offset factor based on the local private key and the current round of encryption index.

Specifically, when a blockchain node satisfies the decryption conditions, the blockchain node splices its own private key with the current round of encryption index to generate an offset message, and uses a message digest algorithm or a secure hash algorithm to verify the The offset message is hashed to generate an encrypted offset factor for the blockchain node. Among them, in order to prevent the encryption offset factor from being leaked by the blockchain node, there is a risk of data leakage. Therefore, in order to ensure the privacy and security of the data, the blockchain node will not store the encryption offset factor for a long time.

Exemplarily, taking blockchain node A that satisfies the decryption condition as an example, blockchain node A reads the local private key sk _A , splices the local private key sk _A with the current round of encryption index index, and generates an offset message ( sk _A |index). Then hash the offset message through the message digest algorithm or secure hash algorithm to generate the encryption offset factor of blockchain node A, that is, the encryption offset factor r _A = H(sk _A | index). Similarly, other blockchain nodes that meet the decryption conditions can also generate encrypted offset factors in the same manner as blockchain node A generates encrypted offset factors.

Step b. The blockchain node that satisfies the decryption condition reads the offset commitment of each blockchain node in the smart contract.

Exemplarily, blockchain node A that satisfies the decryption condition is taken as an example. Blockchain node A reads the offset commitment of each blockchain node from the smart contract E_Contract. For example, the alliance chain has four blockchain nodes, namely Blockchain node A, blockchain node B, blockchain node C, and blockchain node D. Blockchain node A reads the offset commitment R _A of blockchain node A, the offset commitment R _B of blockchain node B, the offset commitment R _C of blockchain node C, and the block from the smart contract E_Contract Offset commitment RD of chain node _D.

Step c. The blockchain node that satisfies the decryption condition generates a third ciphertext fragment based on its encryption offset factor and public key, and determines from the smart contract based on the third ciphertext fragment. The first ciphertext fragment that matches the text fragment and the second ciphertext fragment that matches the third ciphertext fragment are determined to match the first ciphertext fragment and the second ciphertext fragment through bilinear mapping. Shards, private keys, and offset commitments are processed to generate verification shards of blockchain nodes.

Exemplarily, taking the blockchain node A that satisfies the decryption condition as an example, the blockchain node A uses the encryption offset factor r _A and the public key pk _A to generate the third ciphertext fragment Q _A ′=r _A *pk _A. And based on the third ciphertext fragment Q A ′, determine the first ciphertext fragment Q _A that matches the third ciphertext fragment Q _A ′ from E_Contract in the smart contract and determine the third ciphertext fragment Q _A Fragment Q _A ' matches the second ciphertext fragment T _A . Then, through the bilinear mapping, the offset commitment, encryption offset factor, first ciphertext fragmentation, second ciphertext fragmentation and private key of blockchain node A are processed to generate Validation shard E _A .

which is:

Similarly, for the verification fragment E _B of the blockchain node B that satisfies the decryption condition. which is:

The verification fragment E _C for the block chain node C that satisfies the decryption condition. which is:

The verification fragment E _D for the block chain node D that satisfies the decryption condition. which is:

Step d. The blockchain nodes that meet the decryption conditions use their private keys to sign the verification fragments they generate, generate signatures for the verification fragments, and upload the verification fragments and the signatures of the verification fragments to the smart contract.

Exemplarily, taking the block chain node A that satisfies the decryption condition as an example, the block chain node A uses the private key sk _A to sign the verification _segment E _A , and generates the signature delta _A = sign( E _A , sk _A ), and upload the verification fragment and the signature of the verification fragment (ie E _A and delta _A ) to the smart contract.

Similarly, for the blockchain node B, the blockchain node B generates the signature delta _B =sign(E _B ,sk _B ) for the verification segment E _B , and uploads E _B and delta _B to the smart contract. For the blockchain node C, the blockchain node C generates the signature delta _C =sign(EC , sk _C ) of the verification fragment E _C , and uploads _{E C and delta C} _to _the smart contract. For the blockchain node D, the blockchain node D generates the signature delta _D =sign(E _D ,sk _D ) of the verification segment E _D , and uploads E _D and delta _D to the smart contract.

Step e. After confirming that each blockchain node has uploaded its own verification fragment and signature of the verification fragment to the smart contract, for each blockchain node, the blockchain node verifies the verification fragments of other blockchain nodes. Shard is the same as its own verification shard.

Specifically, for each blockchain node, the blockchain node obtains the verification fragments of other blockchain nodes and the signatures of the verification fragments from the smart contract. Then, the blockchain node uses the public keys of other blockchain nodes to verify the signatures of the verification fragments of other blockchain nodes, and after confirming that the signature verification of the verification fragments of other blockchain nodes is successful, determine Whether the verification fragments of other blockchain nodes are the same as their own verification fragments.

Exemplarily, taking blockchain node A that satisfies the decryption condition as an example, blockchain node A uses the public key pk _B of blockchain node B to verify the signature delta _B of blockchain node B's fragment E _B Verification, use the public key pk _C of the blockchain node C to verify the signature delta _C of the verification fragment E _C of the blockchain node C, and use the public key pk _D of the blockchain node D to verify the signature delta C of the blockchain node D The signature delta _D of the verification fragment E _D of the blockchain node B is verified, and the signature delta _B of the verification fragment E _B of the blockchain node B, the signature delta _C of the verification fragment E _C of the blockchain node C, and the blockchain After the signature delta _D of the verification fragment E _D of node D is successfully verified, it is determined that its own verification fragment E _A and the verification fragment E _B of the blockchain node B and the verification fragment E C of the blockchain node _C And whether the verification fragments E _D of the blockchain node D are the same. Similarly, blockchain node B, blockchain node C, or blockchain node D will also verify the signatures of other blockchain nodes' verification fragments, and determine the signatures of other blockchain nodes' verification fragments. After the signature verification is successful, determine whether your own verification shard is the same as that of other blockchain nodes, which will not be repeated here.

Step f. For each blockchain node, the blockchain node uploads its encrypted offset factor to the smart contract after determining that the verification fragments of other blockchain nodes are the same as its own verification fragments.

Exemplarily, taking blockchain node A that satisfies the decryption condition as an example, blockchain node A determines its own verification fragment E _A and blockchain node B's verification fragment E _B , and blockchain node C's After the verification fragment E _C and the verification fragment E _D of the blockchain node D are the same, upload their encrypted offset factor r _A to the smart contract. Similarly, after blockchain node B, blockchain node C, or blockchain node D confirms that their own verification fragments are the same as those of other blockchain nodes, they will also set their encryption offset factors Upload to the smart contract, so I won’t repeat it here. Then, after each blockchain node uploads its encrypted offset factor to the smart contract, each blockchain node will generate the next round of encrypted offset factor, that is, blockchain node A will generate the next round of encrypted offset factor r _A '=H(sk _A |index'); blockchain node B generates the next round of encryption offset factor r _B '=H(sk _B |index'); blockchain node C generates the next round of Encrypted offset factor r _C '=H(sk _C |index'); blockchain node D generates the encrypted offset factor r _D '=H(sk _D |index') for the next round. Among them, index'=index+1.

Step g. For each blockchain node, the blockchain node obtains the encryption offset factor of each blockchain node from the smart contract, and determines and verifies from the value range of the binary number through bilinear mapping The binary number matched by the slice is used as the decryption result.

Specifically, for each blockchain node, the blockchain node sequentially traverses the binary numbers in the value range of the binary numbers, and based on the verification fragmentation, through bilinear mapping, determines the number that matches the verification fragmentation Binary number, and use the binary number as the decryption result. Of course, by converting the binary number into a decimal number, the data to be encrypted encrypted by the client can be obtained.

Exemplarily, take the blockchain node A that satisfies the decryption condition as an example, the blockchain node A can traverse in sequence according to the value range of the binary number from small to large or from large to small, and based on the verification fragmentation, through the two-line property mapping, to determine whether each traversed data m _i satisfies

Among them, the right side of the equation is a verification slice, which is also a value. If it is determined that a certain data m _i satisfies, the data m _i is used as the decrypted data, that is, the data m _i is the data to be encrypted by the client. For example, if the data to be encrypted is 10 as an example, then the binary number of the number 10 is 1010, and the blockchain nodes can traverse sequentially from the binary number 0 until it reaches 1010.

In this way, the data 1010 can be used as the decrypted data.

Step h, other blockchain nodes perform consensus verification on the data to be encrypted decrypted by the blockchain node stored on the blockchain, and determine the data to be encrypted and the verification data decrypted by the blockchain node through bilinear mapping Shard matching.

Exemplarily, taking the block chain node A that decrypts the data to be encrypted as an example, other block chain nodes obtain the to-be-encrypted data m _i decrypted by the block chain node A from the smart contract. For example, blockchain node B obtains the decrypted data mi to be encrypted from the smart contract, _blockchain node C obtains the decrypted data mi to be encrypted from the smart contract, and _blockchain node D obtains the decrypted data mi from the smart contract The output to be encrypted data m _i . The blockchain node B verifies the matching between the encrypted data mi decrypted by the _blockchain node A and the verification fragment through the bilinear mapping algorithm. That is, verify that

If it is satisfied, the blockchain node B confirms that the data mi to be encrypted decrypted by the _blockchain node A is correct. At the same time, the blockchain node C will also verify the matching of the encrypted data mi decrypted by the _blockchain node A and the verification fragment through the bilinear mapping algorithm. That is, verify that

If it is satisfied, the blockchain node C confirms that the data mi to be encrypted decrypted by the _blockchain node A is correct. And the blockchain node D will also verify the matching between the encrypted data mi decrypted by the _blockchain node A and the verification fragment through the bilinear mapping algorithm. That is, verify that

If it is satisfied, the blockchain node D confirms that the data mi to be encrypted decrypted by the _blockchain node A is correct. It is determined that there are two or more blockchain nodes in the blockchain node B, blockchain node C and blockchain node D to verify that the encrypted data m _i and the verification fragment decrypted by the blockchain node A are If it matches, record the data mi to be encrypted to the _blockchain , and complete the decryption operation; otherwise, the decryption operation fails.

The above embodiment shows that, for any blockchain node, when the local time stamp is determined to meet the decryption time stamp in the smart contract, the decryption operation can be started. That is, the index ciphertext is generated based on the public and private keys of the blockchain nodes, and based on the index ciphertext, the first ciphertext score that matches the index ciphertext can be determined in a timely and accurate manner from the encrypted information uploaded by the client to the smart contract. slice and a second ciphertext slice that matches the index ciphertext. Then, through bilinear mapping, the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext are processed to obtain the verification fragment of the blockchain node, and verify After the m verification fragments meet the set requirements, the second ciphertext fragment matching the index ciphertext is decrypted to obtain the data to be encrypted. In this way, since the scheme does not require blockchain nodes to perform encryption operations on the data to be encrypted, and each blockchain node uses different public and private keys instead of using the same public and private keys, it can ensure the privacy and security of the data to be encrypted. In addition, since this scheme does not need to re-initialize the key to generate public and private keys every time the decryption operation is performed, but always uses the public and private keys of each blockchain node, it can make the decryption process of the scheme simpler and more convenient , so that the cost of the decryption operation can be reduced.

Based on the same technical concept, FIG. 2 exemplarily shows a data processing device based on a smart contract provided by an embodiment of the present invention, and the device can execute a flow of a data processing method based on a smart contract. Wherein, the smart contract-based data processing method is applicable to a consortium chain with m blockchain nodes.

As shown in Figure 2, the device includes:

The generation unit 201 is used to generate index ciphertext based on the public and private keys of the block chain node when it is determined that the decryption time stamp in the smart contract is met for any block chain node; the decryption time stamp is generated by the client is used to indicate the time to decrypt the encrypted information uploaded by the client to the smart contract; the encrypted information includes the first ciphertext fragment and the second ciphertext fragment for each blockchain node ; The first ciphertext fragment is generated by the client based on the public and private keys of the blockchain nodes; the second ciphertext fragment is generated by the client based on the data to be encrypted;

The first processing unit 202 is configured to determine from the encrypted information a first ciphertext segment matching the index ciphertext and a second ciphertext segment matching the index ciphertext; through bilinear Mapping, processing the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext, obtaining the verification fragment of the blockchain node, and converting the The verification fragments are uploaded to the smart contract; after verifying that the m verification fragments meet the set requirements, the second ciphertext fragments matching the index ciphertext are decrypted to obtain the data to be encrypted.

Optionally, the generating unit 201 is specifically configured to:

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

Obtain the first commitment fragments of m blockchain nodes from the smart contract; the first commitment fragments are generated by the blockchain nodes based on their respective encryption offset factors;

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

If yes, confirm that the m verification fragments are verified successfully.

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

The first processing unit 202 is specifically used for:

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

Based on the same technical concept, FIG. 3 exemplarily shows another smart contract-based data processing device provided by an embodiment of the present invention, and the device can execute the flow of the smart contract-based data processing method. Wherein, the smart contract-based data processing method is applicable to a consortium chain with m blockchain nodes.

As shown in Figure 3, the device includes:

The obtaining unit 301 is configured to obtain the first commitment fragments of the m blockchain nodes from the smart contract, and obtain the encrypted offset factors of the m blockchain nodes through a secret communication channel; the first commitment fragments Shards are generated by blockchain nodes based on their respective encrypted offset factors; the encrypted offset factors are generated by blockchain nodes based on their respective private keys;

The second processing unit 302 is configured to, for each block chain node, generate a first ciphertext fragment based on the encryption offset factor of the block chain node and the public key of the block chain node, and based on the block chain node to be Encrypt data and the first commitment fragments of other blockchain nodes except the blockchain node, generate a second ciphertext fragment; generate a decryption timestamp; combine the decryption timestamp and the m blocks The first ciphertext fragment and the second ciphertext fragment of the chain node are uploaded to the smart contract; the decryption timestamp is used to indicate that any block chain node determines that the local timestamp satisfies the decryption timestamp The first ciphertext fragment and the second ciphertext fragment in the smart contract are decrypted.

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

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 instructions included in the aforementioned smart contract-based data processing method by executing the instructions stored in the memory 402. step.

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 smart contract-based data processing 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 above smart contract-based data processing method.

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.

These computer program instructions can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby The instructions provide steps for implementing the functions specified in the flow chart or blocks of the flowchart and/or the block or blocks of the block diagrams.

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 data processing method based on an intelligent contract is characterized in that it is applicable to a consortium chain having m blockchain nodes, and the method comprises:

For any blockchain node, when the blockchain node determines that the decryption timestamp in the smart contract is met, an index ciphertext is generated based on the public and private keys of the blockchain node; the decryption timestamp is generated by the client is used to indicate the time to decrypt the encrypted information uploaded by the client to the smart contract; the encrypted information includes the first ciphertext fragment and the second ciphertext fragment for each blockchain node ; The first ciphertext fragment is generated by the client based on the public and private keys of the blockchain nodes; the second ciphertext fragment is generated by the client based on the data to be encrypted;

The blockchain node determines from the encrypted information a first ciphertext fragment matching the index ciphertext and a second ciphertext fragment matching the index ciphertext;

The block chain node processes the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext through bilinear mapping to obtain the block The verification fragment of the chain node, and upload the verification fragment to the smart contract;

After verifying that the m verification fragments meet the set requirements, the blockchain node decrypts the second ciphertext fragment matching the index ciphertext to obtain the data to be encrypted.
The method according to claim 1, wherein generating index ciphertext based on the public and private keys of the blockchain nodes comprises:

The block chain node splices the private key of the block chain node with the encryption index of the current round to generate an offset message;

The blockchain node performs a hash operation on the offset message to generate an encrypted offset factor;

The blockchain node generates the index ciphertext based on the encryption offset factor and the public key of the blockchain node.
The method according to claim 1, wherein the block chain node performs bilinear mapping on the first ciphertext fragment matching the index ciphertext and the second ciphertext matching matching the index ciphertext Two ciphertext fragments are processed to obtain the verification fragments of the blockchain nodes, including:

The blockchain node acquires the first commitment fragments of m blockchain nodes from the smart contract; the first commitment fragments are generated by the blockchain nodes based on their respective encryption offset factors;

The blockchain node uses the bilinear mapping to encrypt the offset factor of the blockchain node, the first ciphertext fragment matching the index ciphertext, and the first ciphertext fragment matching the index ciphertext. The second ciphertext fragment, the first commitment fragment of the blockchain node, and the private key of the blockchain node are converted to generate a verification fragment of the blockchain node.
The method according to claim 1, wherein the blockchain node verifies that the m verification fragments meet the set requirements, including:

The block chain node determines whether the verification fragmentation of the block chain node is the same as the verification fragmentation of other block chain nodes except the block chain node;

If yes, the block chain node confirms that the verification of the m verification fragments is successful.
The method according to claim 4, wherein, after the block chain node confirms that the verification of the m verification fragments is successful, further comprising:

The blockchain node uploads the encrypted offset factor of the blockchain node to the smart contract;

Decrypting the second ciphertext segment matching the index ciphertext to obtain the data to be encrypted, including:

The blockchain node obtains the encrypted offset factors of the m blockchain nodes from the smart contract;

The blockchain node decrypts the second ciphertext fragment matching the index ciphertext based on the encryption offset factors of the m blockchain nodes through the bilinear mapping, and obtains the Data to be encrypted.
The method according to claim 5, further comprising: after obtaining the data to be encrypted:

Each block chain node in other block chain nodes except the block chain node obtains the data to be encrypted decrypted by the block chain node and the encryption bias of the m block chain nodes from the smart contract shift factor; the data to be encrypted is uploaded to the smart contract by the block chain node;

Each block chain node in the other block chain nodes decrypts the data to be encrypted by the block chain nodes based on the encryption offset factors of the m block chain nodes through the bilinear mapping Verification is performed to determine the matching between the data to be encrypted and the verification segment, so as to determine whether the decrypted data to be encrypted is correct.
A data processing method based on an intelligent contract is characterized in that it is applicable to a consortium chain having m blockchain nodes, and the method comprises:

The client obtains the first commitment fragment of the m blockchain nodes from the smart contract, and obtains the encrypted offset factors of the m blockchain nodes through a secret communication channel; the first commitment fragment is a block Chain nodes are generated based on their respective encrypted offset factors; the encrypted offset factors are generated by blockchain nodes based on their respective private keys;

For each block chain node, the client generates the first ciphertext fragment based on the encryption offset factor of the block chain node and the public key of the block chain node, and based on the data to be encrypted and the The first commitment fragment of other blockchain nodes other than the blockchain node generates a second ciphertext fragment;

The client generates a decryption timestamp;

The client uploads the decrypted timestamp and the first ciphertext fragment and the second ciphertext fragment of the m blockchain nodes to the smart contract; the decrypted timestamp is used to indicate any The blockchain node decrypts the first ciphertext fragment and the second ciphertext fragment in the smart contract when determining that the local timestamp satisfies the decryption timestamp.
The method according to claim 7, wherein, before generating the first ciphertext fragment, further comprising:

For each blockchain node, the client generates a second commitment fragment of the blockchain node based on the encryption offset factor of the blockchain node;

The client determines whether the first commitment fragments of the m blockchain nodes and the second commitment fragments of the m blockchain nodes are all corresponding to the same;

If yes, the client confirms that the verification of the first committed fragment of the m blockchain nodes is successful.
A data processing device based on an intelligent contract is characterized in that it is suitable for an alliance chain with m blockchain nodes, and the device includes:

The generation unit is used to generate index ciphertext based on the public and private keys of the blockchain node when it is determined that the decryption timestamp in the smart contract is met for any blockchain node; the decryption timestamp is generated by the client Used to indicate the time to decrypt the encrypted information uploaded by the client to the smart contract; the encrypted information includes a first ciphertext fragment and a second ciphertext fragment for each blockchain node; The first ciphertext fragment is generated by the client based on the public and private keys of the blockchain nodes; the second ciphertext fragment is generated by the client based on the data to be encrypted;

A first processing unit, configured to determine from the encrypted information a first ciphertext segment matching the index ciphertext and a second ciphertext segment matching the index ciphertext; through bilinear mapping , process the first ciphertext fragment matching the index ciphertext and the second ciphertext fragment matching the index ciphertext to obtain the verification fragment of the blockchain node, and the The verification fragments are uploaded to the smart contract; after verifying that the m verification fragments meet the set requirements, decrypt the second ciphertext fragments matching the index ciphertext to obtain the data to be encrypted.
A data processing device based on an intelligent contract is characterized in that it is suitable for an alliance chain with m blockchain nodes, and the device includes:

An acquisition unit, configured to acquire the first commitment fragments of the m blockchain nodes from the smart contract, and acquire the encrypted offset factors of the m blockchain nodes through a secret communication channel; the first commitment fragments are generated by blockchain nodes based on their respective encrypted offset factors; the encrypted offset factors are generated by blockchain nodes based on their respective private keys;

The second processing unit is configured to, for each block chain node, generate a first ciphertext fragment based on the encryption offset factor of the block chain node and the public key of the block chain node, and based on the Data and the first commitment fragments of other blockchain nodes except the blockchain node, generate a second ciphertext fragment; generate a decryption timestamp; combine the decryption timestamp and the m blockchain nodes The first ciphertext fragment and the second ciphertext fragment of the node are uploaded to the smart contract; the decryption timestamp is used to instruct any block chain node to update the decryption timestamp when the local timestamp meets the decryption timestamp The first ciphertext fragment and the second ciphertext fragment in the smart contract are decrypted.