A data encryption deletion method, device, system and equipment of a double-chain block chain

Abstract

The present application relates to the technical field of block chain, and is suitable for the field of block chain financial risk control, in particular to a data encryption deletion method, device, system and equipment of double-chain block chain. The method comprises the following steps: any one of the data deletion nodes sends a deletion application to a predetermined number of data deletion nodes; after the deletion application is agreed, the deletion list is encrypted, and a respective encryption function is constructed; the encrypted deletion list is encrypted twice by using the respective encryption function respectively to obtain a first ciphertext; a deletion request is generated according to the encryption function and the first ciphertext; the deletion request is sent to the information chain, so that the information chain deletes the corresponding data in the data table after receiving the deletion request meeting the predetermined condition and passing the consensus verification of the deletion request. Through the embodiment of the application, the data in the information chain is deleted after the multi-party financial institutions first negotiate and agree.

Description

Technical Field

[0001] This article relates to the field of blockchain technology, and is applicable to the field of blockchain financial risk control. In particular, it relates to a method, device, system and equipment for data encryption and deletion of dual-chain blockchain. Background Technology

[0002] Currently, financial institutions are using consortium blockchain technology to store user data and achieve data sharing among them. When one financial institution needs to delete user data, it needs to send a data deletion request to the on-chain node of the consortium blockchain. The consortium blockchain searches the data stored in the consortium blockchain according to the content of the data deletion request and deletes the results found.

[0003] However, with current consortium blockchain technology, any financial institution can arbitrarily delete data. The consensus verification of deletion requests in a consortium blockchain is limited to verifying the request format and cannot determine whether the deletion request has been agreed upon by all the financial institutions within the consortium blockchain. Furthermore, because deletion requests are currently transmitted in plaintext in consortium blockchain technology, malicious eavesdropping could lead to the leakage of user information.

[0004] There is an urgent need for a dual-chain blockchain data encryption and deletion method to solve the problem of poor data security in consortium blockchains caused by the fact that any financial institution can arbitrarily delete data in the consortium blockchain without being able to perform encrypted deletion. Summary of the Invention

[0005] To address the problems in the prior art, this embodiment provides a method, apparatus, system, and device for data encryption and deletion in a dual-chain blockchain. This method involves multiple financial institutions first negotiating, and after reaching an agreement, each institution encrypts the agreed-upon deletion list. Based on the encrypted deletion list and encryption function, they generate deletion requests and send them to the information chain. Once the received deletion request meets predetermined conditions, the information chain determines the data to be deleted and deletes it using a secondary encryption intersection method.

[0006] To solve any of the above-mentioned technical problems, the specific technical solution presented in this paper is as follows:

[0007] On the one hand, this embodiment provides a data encryption and deletion method for a dual-chain blockchain, executed by multiple data deletion nodes, including:

[0008] Any data node to be deleted sends a deletion request to a predetermined number of data nodes to be deleted, and the deletion request includes a deletion list;

[0009] The deletion list is encrypted, and its respective encryption functions are constructed. The encrypted deletion list is then encrypted a second time using the respective encryption functions to obtain the first ciphertext.

[0010] A deletion request is generated based on the encryption function and the first ciphertext;

[0011] The deletion request is sent to the information chain. After the information chain receives a deletion request that meets the predetermined conditions and passes the consensus verification of the deletion request, any on-chain node of the information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored by the information chain, so as to obtain a second ciphertext set corresponding to the received encryption function. The intersection of the first ciphertext and the second ciphertext corresponding to the same encryption function is performed to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then the data of the encrypted account information is deleted from the data table.

[0012] Based on the same inventive concept, this invention also provides a data encryption and deletion method for a dual-chain blockchain, executed by the information chain, the method comprising:

[0013] The system receives deletion requests from multiple data deletion nodes. The deletion request is generated after any one data deletion node sends a deletion application to a predetermined number of data deletion nodes. The multiple data deletion nodes encrypt the deletion list in the deletion application and construct their own encryption functions. They then use their respective encryption functions to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext. The system is generated based on the encryption functions and the first ciphertext.

[0014] Determine whether the received deletion request meets the predetermined conditions;

[0015] After a received deletion request meets the predetermined conditions and passes consensus verification, any on-chain node of the control information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored in the information chain, obtaining a second ciphertext set corresponding to the received encryption function. The intersection of the first ciphertext and the second ciphertext set corresponding to the same encryption function is then performed to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then the data of that encrypted account information is deleted from the data table.

[0016] On the other hand, embodiments of the present invention also provide a data encryption and deletion device for a dual-chain blockchain, comprising:

[0017] A deletion request sending unit is used for any data node to send a deletion request to a predetermined number of data nodes to be deleted, wherein the deletion request includes a deletion list;

[0018] The deletion list encryption unit is used to encrypt the deletion list and construct its own encryption function. It then uses its own encryption function to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext.

[0019] A deletion request generation unit is used to generate a deletion request based on the encryption function and the first ciphertext;

[0020] A deletion request sending unit is used to send the deletion request to the information chain, so that after the information chain receives a deletion request that meets predetermined conditions and passes the consensus verification of the deletion request, any on-chain node of the information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored by the information chain to obtain a second ciphertext set corresponding to the received encryption function. The first ciphertext and the second ciphertext set corresponding to the same encryption function are intersected to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then the data of the encrypted account information is deleted from the data table.

[0021] Based on the same inventive concept, embodiments of the present invention also provide a data encryption and deletion device for a dual-chain blockchain, comprising:

[0022] The deletion request receiving unit is used to receive deletion requests sent by multiple deletion data nodes. The deletion request is generated after any one deletion data node sends a deletion application to a predetermined number of deletion data nodes. The multiple deletion data nodes encrypt the deletion list in the deletion application and construct their own encryption functions. They then use their respective encryption functions to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext. The deletion request is generated based on the encryption functions and the first ciphertext.

[0023] The deletion request judgment unit is used to determine whether the received deletion request meets the predetermined conditions;

[0024] The deletion unit is configured to, upon receiving a deletion request that meets the predetermined conditions and after the consensus verification of the deletion request is passed, control any on-chain node of the information chain to perform secondary encryption on multiple encrypted account information in the data table stored in the information chain using the received encryption function, thereby obtaining a second ciphertext set corresponding to the received encryption function, and to perform intersection calculation on the first ciphertext and the second ciphertext set corresponding to the same encryption function to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then delete the data of the encrypted account information in the data table.

[0025] On the other hand, embodiments of the present invention also provide a dual-chain blockchain data encryption and deletion system, the system comprising: multiple data deletion nodes and an information chain;

[0026] When deleting a data node, the method described above for deleting a data node is executed.

[0027] When the information chain is deleted, the method executed by the aforementioned information chain is performed.

[0028] On the other hand, embodiments of the present invention also provide a computer device, including a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the above-described method.

[0029] On the other hand, embodiments of the present invention also provide a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method.

[0030] Finally, this embodiment of the invention also provides a computer program product, which includes a computer program that, when executed by a processor, implements the above-described method.

[0031] Using the embodiments of the present invention, the first data table on the information chain stores the correspondence between encrypted account information and account tags. Compared with the method of storing plaintext account information in the consortium blockchain in the prior art, the on-chain nodes of the information chain of the present invention only know the plaintext of the account tags. However, because the stored information is encrypted, the on-chain nodes of the information chain cannot know which account these account tags belong to, thereby ensuring the security of account data from the blockchain storage side.

[0032] When a data deletion node generates a deletion request, it first sends deletion requests to other data deletion nodes. These data deletion nodes negotiate the deletion list in the deletion request. After reaching an agreement, each data deletion node generates a deletion request and sends it to the information chain. The information chain can only perform deletion after receiving a deletion request that meets predetermined conditions. Compared with the current method where any data deletion node initiates a deletion request to the consortium blockchain, the method of this invention enables multiple financial institutions to negotiate the deletion list. Furthermore, the information chain side sets up verification of the number and other predetermined conditions of the deletion requests received from multiple data deletion nodes, ensuring data security and preventing any financial institution from arbitrarily deleting data.

[0033] Each data deletion node encrypts the deletion list and then uses a constructed encryption function to perform a second encryption on the encrypted deletion list to obtain the first ciphertext. Compared to the method in existing consortium blockchains where the deleting node sends the deletion list in plaintext, the first ciphertext sent by the deleting node in this invention ensures the security of data deletion during data transmission, even if it is maliciously eavesdropped on during the deletion request process. The eavesdropper can decrypt the first ciphertext using the encryption function to obtain the ciphertext of the deletion list, which is irreversible. Therefore, the eavesdropper cannot know the specific account deleted by the deleting node.

[0034] Furthermore, when the information chain receives a deletion request and performs deletion, compared to the method in existing consortium blockchains where on-chain nodes delete lists based on received plaintext, the deletion request sent in this invention includes a first ciphertext that is a secondary encryption of the encrypted deletion list. The on-chain nodes of the information chain cannot know the specific account being deleted. To address this issue, when the information chain cannot determine the specific account being deleted, the on-chain nodes of this invention perform secondary encryption on multiple encrypted account information in the data table stored in the information chain according to the encryption function in the deletion request sent by the deletion data node, obtaining a second ciphertext set. Since both the first and second ciphertexts are obtained through secondary encryption using the encryption function constructed by the deletion node, the first and second ciphertexts corresponding to the same account information should also be identical. Therefore, the on-chain nodes of the information chain perform intersection calculations on the first and second ciphertext sets to determine which encrypted account information the deletion node deleted, and then determine whether the second ciphertexts in these intersection results correspond to the same encrypted account information. If so, it indicates that these deletion data nodes deleted the same account, and finally, the data corresponding to that encrypted account information is deleted. The data encryption and deletion method described in this invention solves the problem in the prior art where any financial institution can arbitrarily delete data in the consortium blockchain without being able to perform encrypted deletion, resulting in poor data security in the consortium blockchain. Attached Figure Description

[0035] To more clearly illustrate the technical solutions in the embodiments or prior art described herein, the accompanying drawings used in the description of the embodiments or prior art will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this article. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0036] Figure 1 The figure shown is a schematic diagram of an implementation system for a dual-chain blockchain data encryption and deletion method in this embodiment.

[0037] Figure 2The diagram shown is a flowchart illustrating a dual-chain blockchain data encryption and deletion method in an embodiment of this paper.

[0038] Figure 3 The diagram shown is a flowchart illustrating a dual-chain blockchain data encryption and deletion method in an embodiment of this paper.

[0039] Figure 4 The diagram illustrates the process of deleting a data node and updating its queryability in this embodiment.

[0040] Figure 5 The diagram illustrates the process of deleting a data node and checking its queryability in this embodiment.

[0041] Figure 6 The diagram illustrates the process of deleting a data node from the information chain to query an account tag in this embodiment.

[0042] Figure 7 The diagram illustrates the process of deleting a data node and querying the data provider via the information chain in this embodiment.

[0043] Figure 8 The diagram shown is a structural schematic of a dual-chain blockchain data encryption and deletion device in an embodiment of this paper.

[0044] Figure 9 The diagram shown is a structural schematic of a dual-chain blockchain data encryption and deletion device in an embodiment of this paper.

[0045] Figure 10 The diagram shown is a data flow diagram of a dual-chain blockchain data encryption and deletion system in an embodiment of this paper.

[0046] Figure 11 The diagram shown is a structural schematic of the computer device in the embodiments of this article.

[0047] [Explanation of Figure Markers]:

[0048] 101. Delete data nodes;

[0049] 102. Information chain;

[0050] 103. Account Chain;

[0051] 104. Service Gateway;

[0052] 801. Delete the application sending unit;

[0053] 802. Delete the encrypted list unit;

[0054] 803. Delete request generation unit;

[0055] 804. Delete request sending unit;

[0056] 901. Delete request receiving unit;

[0057] 902. Deletion request judgment unit;

[0058] 903. Delete unit;

[0059] 1102. Computer equipment;

[0060] 1104. Processing equipment;

[0061] 1106. Storage resources;

[0062] 1108. Drive mechanism;

[0063] 1110. Input / output module;

[0064] 1112. Input devices;

[0065] 1114. Output devices;

[0066] 1116. Presentation device;

[0067] 1118. Graphical User Interface;

[0068] 1120. Network interface;

[0069] 1122. Communication link;

[0070] 1124. Communication bus. Detailed Implementation

[0071] The technical solutions in the embodiments described below will be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments described herein, and not all of the embodiments. Based on the embodiments described herein, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this document.

[0072] It should be noted that the terms "first," "second," etc., used in the specification, claims, and accompanying drawings herein are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, apparatus, product, or device that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or devices.

[0073] It should be noted that the acquisition, storage, use, and processing of data in the technical solution of this application all comply with the relevant provisions of national laws and regulations.

[0074] like Figure 1 The diagram shows an implementation system schematic of a dual-chain blockchain data encryption and deletion method according to an embodiment of the present invention. It may include multiple data deletion nodes 101 and an information chain 102. Any data deletion node 101 sends a deletion request to other data deletion nodes. Each data deletion node negotiates the deletion request, and after the negotiation is successful, the data deletion node sends a deletion request to the information chain 102. The on-chain nodes of the information chain 102 perform consensus verification on the deletion request. After the consensus verification is successful, any on-chain node processes the deletion request and deletes the corresponding data in the data table stored in the information chain.

[0075] In some other embodiments of the present invention, the implementation system of the dual-chain blockchain data encryption and deletion method may further include an account chain 103. The account chain 103 stores account information corresponding to the deleted data node 101, such as determining the queryability of the deleted data node on the information chain. After deleting data, the deleted data node can send a request to the account chain 103 to update its corresponding queryability. When the deleted data node 101 needs to query data from the information chain 102, it first sends a query request to the account chain 103. The on-chain nodes of the account chain 103 perform consensus verification on the query request. After the consensus verification is successful, they determine the account information corresponding to the deleted data node 101 in their respective stored blocks and then send the account information to the deleted data node 101 so that the deleted data node 101 can determine whether it can query based on the account information. Furthermore, after the deleted data node 101 sends a query request to the information chain 102, the on-chain nodes of the account chain 103 update the account information of the deleted data node 101 stored in their respective blocks, such as updating the queryability of the deleted data node 101. It should be noted that the account information stored in the blocks of the on-chain nodes of account chain 103 can record more content as needed, and this embodiment of the invention does not impose any restrictions.

[0076] In some other embodiments of the present invention, the implementation system of the dual-chain blockchain data encryption and deletion method may further include a service gateway 104, used to forward requests from the deletion data node 101 to update its queryability to on-chain nodes of the account chain 103. The service gateway 104 may also forward deletion requests from the deletion data node 101 to on-chain nodes of the information chain 102.

[0077] In addition, it should be noted that, Figure 1 The example shown is merely one application environment provided by this disclosure. In practical applications, other application environments may also be included, and this specification does not impose any limitations.

[0078] In this embodiment of the invention, the information chain is used to store account data. This account data is determined by each financial institution based on its users' transaction history, credit history, etc. The account data may include users' blacklist tags, etc. The determined account data is then shared in the information chain for other financial institutions to query and reference. For example, financial institution A can query the information chain for a user whose blacklist tag has been determined by financial institution B, which is equivalent to financial institution A using the results of financial institution B. To incentivize financial institutions to share their determined account tags, a paid data sharing mechanism is needed. If existing consortium blockchain technology is applied, with each financial institution acting as an on-chain node, then sharing data would require each financial institution to determine the account data based on its own users' transaction history, etc. Therefore, in this invention, the nodes of each financial institution cannot act as on-chain nodes of the consortium blockchain, but rather as off-chain nodes. However, off-chain nodes, in addition to sharing account data with the information chain, also have permissions to access data within the information chain. But if any financial institution's node arbitrarily deletes data from the information chain, the work results of other financial institutions stored on the information chain may be maliciously deleted. To address this situation, this invention provides a dual-chain blockchain data encryption and deletion method. This method involves multiple financial institutions first negotiating and reaching an agreement. After reaching an agreement, all financial institutions encrypt the agreed-upon deletion list and generate a deletion request based on the encrypted deletion list and encryption function. The deletion request is then sent to the information chain. Once the received deletion request meets predetermined conditions, the information chain determines the data to be deleted and deletes it using a two-stage encryption intersection method. Figure 2 The diagram illustrates a data encryption and deletion method for a dual-chain blockchain according to an embodiment of this paper. While the process of encrypting and deleting data is described in this diagram, it can include more or fewer steps based on conventional or non-creative labor. The order of steps listed in the embodiment is merely one possible execution order among many and does not represent the only possible order. In actual system or device products, the methods shown in the embodiment or the accompanying drawings can be executed sequentially or in parallel. Specifically, as shown... Figure 2 As shown, this can be performed by deleting data node 101, and the method may include:

[0079] Step 201: Any data node to be deleted sends a deletion request to a predetermined number of data nodes to be deleted, the deletion request including a deletion list;

[0080] Step 202: After reaching a consensus on the deletion requests, the deletion list is encrypted, and respective encryption functions are constructed. The encrypted deletion list is then encrypted a second time using the respective encryption functions to obtain the first ciphertext.

[0081] Step 203: Generate a deletion request based on the encryption function and the first ciphertext;

[0082] Step 204: Send the deletion request to the information chain.

[0083] After receiving a deletion request that meets predetermined conditions and passing consensus verification of the deletion request, any on-chain node of the information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored in the information chain, obtaining a second ciphertext set corresponding to the received encryption function. The intersection of the first ciphertext and the second ciphertext set corresponding to the same encryption function is then performed to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then the data of that encrypted account information is deleted from the data table.

[0084] Correspondingly, this embodiment of the invention also provides a data encryption and deletion method for a dual-chain blockchain, executed by information chain 102, such as... Figure 3 As shown, the method may include:

[0085] Step 301: Receive deletion requests from multiple data deletion nodes;

[0086] In this step, the deletion request is made by any deletion data node sending a deletion application to a predetermined number of deletion data nodes. After reaching a consensus on the deletion application, multiple deletion data nodes encrypt the deletion list in the deletion application and construct their own encryption functions. They then use their respective encryption functions to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext. The deletion is generated based on the encryption function and the first ciphertext.

[0087] Step 302: Determine whether the received deletion request meets the predetermined conditions;

[0088] Step 303: After the received deletion request meets the predetermined conditions and the consensus verification of the deletion request is passed, any on-chain node of the control information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored in the information chain, respectively, to obtain the second ciphertext set corresponding to the received encryption function. The intersection of the first ciphertext and the second ciphertext set corresponding to the same encryption function is performed to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then the data of the encrypted account information is deleted from the data table.

[0089] Using the embodiments of the present invention, the first data table on the information chain stores the correspondence between encrypted account information and account tags. Compared with the method of storing plaintext account information in the consortium blockchain in the prior art, the on-chain nodes of the information chain of the present invention only know the plaintext of the account tags. However, because the stored information is encrypted, the on-chain nodes of the information chain cannot know which account these account tags belong to, thereby ensuring the security of account data from the blockchain storage side.

[0090] When a data deletion node generates a deletion request, it first sends deletion requests to other data deletion nodes. These data deletion nodes negotiate the deletion list in the deletion request. After reaching an agreement, each data deletion node generates a deletion request and sends it to the information chain. The information chain can only perform deletion after receiving a deletion request that meets predetermined conditions. Compared with the current method where any data deletion node initiates a deletion request to the consortium blockchain, the method of this invention enables multiple financial institutions to negotiate the deletion list. Furthermore, the information chain side sets up verification of the number and other predetermined conditions of the deletion requests received from multiple data deletion nodes, ensuring data security and preventing any financial institution from arbitrarily deleting data.

[0091] Each data deletion node encrypts the deletion list and then uses a constructed encryption function to perform a second encryption on the encrypted deletion list to obtain the first ciphertext. Compared to the method in existing consortium blockchains where the deleting node sends the deletion list in plaintext, the first ciphertext sent by the deleting node in this invention ensures the security of data deletion during data transmission, even if it is maliciously eavesdropped on during the deletion request process. The eavesdropper can decrypt the first ciphertext using the encryption function to obtain the ciphertext of the deletion list, which is irreversible. Therefore, the eavesdropper cannot know the specific account deleted by the deleting node.

[0092] Furthermore, when the information chain receives a deletion request and queries it, compared to the method in existing consortium blockchains where on-chain nodes generate deletion lists based on received plaintext, the deletion request sent in this invention includes a first ciphertext that is a secondary encryption of the encrypted deletion list. The on-chain nodes of the information chain cannot determine the specific account being deleted. To address this issue, when the information chain cannot determine the specific account being deleted, the on-chain nodes of this invention perform secondary encryption on multiple encrypted account information in the data table stored in the information chain according to the encryption function in the deletion request sent by the deletion data node, obtaining a second ciphertext set. Since both the first ciphertext and the second ciphertext set are obtained through secondary encryption using the encryption function constructed by the deletion node, the first ciphertext and the second ciphertext corresponding to the same account information should also be the same. Therefore, the on-chain nodes of the information chain perform intersection calculations on the first ciphertext and the second ciphertext set to determine which encrypted account information was deleted by the deletion node, and determine whether the second ciphertext in these intersection results corresponds to the same encrypted account information. If so, it indicates that these deletion data nodes deleted the same account, and finally, the data corresponding to that encrypted account information is deleted. The data encryption and deletion method described in this invention solves the problem in the prior art where any financial institution can arbitrarily delete data in the consortium blockchain without being able to perform encrypted deletion, resulting in poor data security in the consortium blockchain.

[0093] In this embodiment of the invention, a deletion data node can send a deletion list to a designated deletion data node in the consortium blockchain, and then these deletion data nodes negotiate the deletion list. The on-chain nodes of the information chain are used to maintain account data, and blockchain technology ensures that no on-chain node of the information chain can arbitrarily tamper with the stored account data.

[0094] The deletion list for deleting data nodes can include user identity information, such as ID card numbers. This plaintext identity information can be encrypted using a simple hash algorithm to generate a hash table, which is irreversible. An ORPF function can be constructed using the OT protocol, and then used to perform a second encryption on the encrypted query list to obtain the first ciphertext.

[0095] In this embodiment of the invention, since the OPRF function generated by the OT protocol is used, the characteristics of the OPRF function prevent the information chain from knowing the input for deleting the data node. Furthermore, because the first and second ciphertexts, after being processed by the OPRF function, are similar in form to a random binary string, the information chain cannot deduce the input from the output of the OPRF function. Hash algorithms are primarily used to protect data integrity.

[0096] In this embodiment of the invention, as user data increases, the data in the data table also grows larger, and excessive data may affect search speed. To address this, this embodiment of the invention can set multiple groups in the data table, which are consistent with the groups in the data deletion node. Therefore, the data deletion node can determine which group the deletion list belongs to. During deletion, the deletion node sends the first ciphertext and the corresponding group information to the information chain. The on-chain nodes on the information chain determine the group corresponding to the group information in the data table and use the first encryption function to perform secondary encryption on the encrypted account information in that group in the data table to obtain the second ciphertext set. This improves the search efficiency of the first data table.

[0097] According to one embodiment of the present invention, in order to forward the deletion request of the deleted data node, a service gateway is further configured to send the deletion request to the information chain, which further includes:

[0098] The deletion request is sent to the service gateway, which then publishes the deletion request to all on-chain nodes of the information chain for consensus verification. After the consensus verification of the deletion request is passed, the service gateway controls any one on-chain node to use the received encryption function to perform secondary encryption on the encrypted account information in the data table stored in the information chain.

[0099] In some other embodiments of the present invention, the service gateway may also forward data exchanged between multiple data deletion nodes. Specifically, sending deletion requests to a predetermined number of data deletion nodes further includes:

[0100] The deletion request and information about a predetermined number of data nodes to be deleted are sent to the service gateway, so that the service gateway forwards the deletion request to the predetermined number of data nodes to be deleted based on the information.

[0101] According to one embodiment of the present invention, since the deletion request is processed by any node on the information chain, in order to improve the processing efficiency of the deletion request, after sending the deletion request to the information chain, the method further includes:

[0102] The service gateway determines the on-chain node in the information chain to process the deletion request and controls the determined on-chain node to perform the deletion.

[0103] In this embodiment of the invention, after the consensus verification of the deletion request is passed by the on-chain nodes of the information chain, the service gateway determines the on-chain node that will handle the deletion request and controls that on-chain node to delete the data. Compared to the method of randomly assigning an on-chain node to handle the deletion request, the service gateway can determine the on-chain node based on the performance of the server where the on-chain node is located, the number of users corresponding to the first ciphertext (because the deletion list may include the ID numbers of multiple users, the data deletion node encrypts each user's ID number and performs secondary encryption using a constructed encryption function to obtain the first ciphertext, so the number of users can be determined from the first ciphertext), etc. For example, the more users there are, the stronger the performance of the server where the on-chain node is located should be, thereby improving the processing efficiency of the data deletion request.

[0104] In this embodiment of the invention, to incentivize financial institutions to share their identified account tags, a paid data sharing mechanism is proposed. Specifically, the searchability stored in the account chain is the number of available queries. These available query counts can be purchased by financial institutions or rewarded queries received by financial institutions after sharing their account tags with the information chain. Each time a financial institution makes a query, it will consume one available query count. If the available query count meets predetermined conditions, a query can be made; otherwise, a query cannot be made.

[0105] According to one embodiment of the present invention, because the data deletion node deletes invalid or erroneous account data in the information chain, the data deletion node can receive a corresponding reward according to the reward system. Therefore, as... Figure 4 As shown, after sending the deletion request to the information chain, the method further includes:

[0106] Step 401: Receive the message from the information chain indicating successful deletion;

[0107] Step 402: Generate a queryability update request based on the account information of the deleted data node;

[0108] Step 403: Send the queryability update request to the account chain so that the account chain updates the queryability of the account information. The queryability is used to determine whether the deleted data node can initiate a query to the information chain.

[0109] In this embodiment of the invention, after sending a queryability update request to the account chain, the method further includes:

[0110] After the consensus verification of the queryability update request is passed, the on-chain nodes of the account chain update the queryability of the account information in their own stored blocks.

[0111] Specifically, queryability can include the number of available queries, and on-chain nodes on the account chain can increase the number of available queries for deleting data nodes in their own blocks.

[0112] When deleting a data node requires querying the information chain, it first needs to check if it has enough available query attempts. Specifically, for example... Figure 5 As shown, before initiating a query to delete a data node, the method further includes:

[0113] Step 501: Send a query request to the account chain;

[0114] After receiving a query request, the on-chain nodes determine the queryability of the data node to be deleted based on the query request. If the consensus verification result of the queryability is passed, the on-chain nodes of the account chain send the queryability to the data node to be deleted.

[0115] Step 502: If the queryability is queryable, encrypt the query list.

[0116] By using a dual-chain structure to distinguish between account information and user blacklist information for data nodes, the query and accounting of account information do not need to include a large amount of user blacklist information, thereby speeding up the query and reducing the amount of data contained in the block.

[0117] Subsequently, the deleted data node initiates a query to the information chain, specifically, as follows: Figure 6 As shown, the query process for deleting a data node may include the following steps:

[0118] Step 601: Encrypt the query list and construct a first encryption function. Use the first encryption function to encrypt the encrypted query list a second time to obtain the first ciphertext.

[0119] Step 602: Generate a first query request based on the first encryption function and the first ciphertext. The first query request is used to query the user tag corresponding to the query list in the information chain.

[0120] Step 603: Send the first query request to the information chain.

[0121] Following this step, after the consensus verification of the first query request is passed, any one of the on-chain nodes in the information chain uses the first encryption function to perform secondary encryption on multiple encrypted account information in the data table stored in the information chain to obtain a second ciphertext set. The intersection of the first ciphertext and the second ciphertext set is obtained to obtain the second ciphertext. Based on the encrypted account information corresponding to the second ciphertext, a query is performed in the first data table to obtain the account tag corresponding to the encrypted account information. A correspondence between the queried account tag and the first ciphertext is established. The account tag and the correspondence between the account tag and the first ciphertext are sent as query results to the data deletion node. The first data table includes the correspondence between the encrypted account information and the account tag.

[0122] Step 604: Determine the account tag corresponding to the query list based on the correspondence between the account tag and the first ciphertext, and the correspondence between the first ciphertext and the query list.

[0123] In this embodiment of the invention, the query list for deleting data nodes may include user identity information, such as ID card numbers. A simple hash algorithm can be used to encrypt the plaintext identity information, generating a hash table that is irreversible. An ORPF function can be constructed using the OT protocol, and this ORPF function can be used to perform a second encryption on the encrypted query list to obtain the first ciphertext.

[0124] In this embodiment of the invention, after receiving the query result returned by the information chain, the deletion data node can determine the plaintext of the account tag corresponding to the plaintext of the ID number based on the correspondence between the ciphertext and plaintext of the ID number when encrypting the query list, and the correspondence between the ciphertext of the ID number and the plaintext of the account tag in the query result. If the financial institution corresponding to the deletion data node suspects the accuracy of the account tag, for example, the financial institution believes that the ID number should have a blacklist tag, but the actual query result does not have a blacklist tag, then the financial institution is very likely to want to know which financial institution provided the blacklist tag. In response to this situation, according to an embodiment of the invention, the information chain also stores a second data table, which includes the correspondence between the encrypted account information and the data provider.

[0125] like Figure 7 As shown, after determining the account tags corresponding to the query list, the method for deleting data nodes further includes:

[0126] Step 701: Generate a second query request based on the first encryption function and the first ciphertext. The second query request is used to query the data provider corresponding to the query list.

[0127] Step 702: Send the second query request to the information chain;

[0128] After the consensus verification of the second query request is passed, any one of the on-chain nodes of the information chain uses the first encryption function to perform secondary encryption on multiple encrypted account information in the second data table stored in the information chain to obtain a third ciphertext set. The intersection of the first ciphertext and the third ciphertext set is obtained to obtain the third ciphertext. Based on the encrypted account information corresponding to the third ciphertext, a query is performed in the second data table to obtain the data provider corresponding to the encrypted account information. The correspondence between the queried data provider and the first ciphertext is established. The correspondence between the data provider and the first ciphertext is sent as the query result to the query node. The second data table includes the correspondence between the encrypted account information and the data provider.

[0129] Step 703: Determine the data provider corresponding to the query list based on the correspondence between the data provider and the first ciphertext, and the correspondence between the first ciphertext and the query list.

[0130] In this embodiment of the invention, the content of the second data table may be the financial institution information recorded by the information chain after receiving the account tag shared by the financial institution. After receiving the second query request to delete the data node, the data provider is sent to the data node to delete. The query process is similar to the processing process of the first query request, and will not be described in detail here.

[0131] In this embodiment of the invention, if the financial institution corresponding to the deleted data node believes that the account tags shared by the data provider may be incorrect, it can perform federated learning with the data provider to re-determine the user's account tags. Specifically, according to one embodiment of the invention, the method further includes:

[0132] A federated learning request for account tags in the query list is initiated to the data provider, so that the nodes of the data provider and the data deletion nodes can perform federated learning on the account tags and redetermine the account tags in the query list.

[0133] The redefined account tag is sent to the information chain so that the on-chain nodes of the information chain update the redefined account tag to the first data table after the consensus verification of the redefined account tag is passed.

[0134] In this embodiment of the invention, the information of the data provider recorded in the second data table of the information chain storage may also include the data provider's node, thereby enabling the deleted data node to perform federated learning with the data provider node.

[0135] Furthermore, after the deleted data node performs federated learning with the data provider node to re-determine the user's account information, a second encryption function can be constructed, and the encrypted query list can be encrypted a second time using the second encryption function to obtain the fourth ciphertext.

[0136] An account tag update request is generated based on the second encryption function, the fourth ciphertext, and the redefined account tag;

[0137] The account tag update request is sent to the information chain so that after the consensus verification of the account tag update request is passed, any one of the on-chain nodes of the information chain uses the second encryption function to perform secondary encryption on multiple encrypted account information in the first data table stored in the information chain to obtain a fifth ciphertext set. The intersection of the fourth ciphertext set and the fifth ciphertext set is calculated, and the newly determined account tag is updated to the first data table according to the encrypted account information corresponding to the fifth ciphertext.

[0138] According to one embodiment of the present invention, because the deleted data node re-shares the account tag, the deleted data node can receive a corresponding reward according to the reward system. Therefore, after the deleted data node sends the re-determined account tag to the information chain, the method further includes:

[0139] The on-chain nodes of the account chain update the queryability of the deleted data node.

[0140] In this embodiment of the invention, the on-chain nodes of the account chain can increase the number of available queries for deleting data nodes.

[0141] Based on the same inventive concept, this embodiment also provides a data encryption and deletion device for a dual-chain blockchain, such as... Figure 8 As shown, it includes:

[0142] The deletion request sending unit 801 is used for any data node to delete to send a deletion request to a predetermined number of data nodes to delete, wherein the deletion request includes a deletion list;

[0143] The deletion list encryption unit 802 is used to encrypt the deletion list after reaching a consensus on the deletion request, and to construct their respective encryption functions, and to use their respective encryption functions to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext.

[0144] The deletion request generation unit 803 is used to generate a deletion request based on the encryption function and the first ciphertext;

[0145] The deletion request sending unit 804 is used to send the deletion request to the information chain, so that after the information chain receives a deletion request that meets the predetermined conditions and the consensus verification of the deletion request is passed, any on-chain node of the information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored by the information chain to obtain a second ciphertext set corresponding to the received encryption function. The intersection of the first ciphertext and the second ciphertext set corresponding to the same encryption function is performed to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then the data of the encrypted account information is deleted from the data table.

[0146] Based on the same inventive concept, embodiments of the present invention also provide a data encryption and deletion device for a dual-chain blockchain, such as... Figure 9 As shown, it includes:

[0147] The deletion request receiving unit 901 is used to receive deletion requests sent by multiple deletion data nodes. The deletion request is generated when any deletion data node sends a deletion application to a predetermined number of deletion data nodes, and after reaching a consensus on the deletion application, the multiple deletion data nodes encrypt the deletion list in the deletion application, construct their own encryption functions, and use their respective encryption functions to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext. The deletion request is generated based on the encryption function and the first ciphertext.

[0148] The deletion request judgment unit 902 is used to determine whether the received deletion request meets the predetermined conditions;

[0149] The deletion unit 903 is used to, after receiving a deletion request that meets the predetermined conditions and after the consensus verification of the deletion request is passed, control any on-chain node of the information chain to perform secondary encryption on multiple encrypted account information in the data table stored in the information chain using the received encryption function, to obtain a second ciphertext set corresponding to the received encryption function, and to find the intersection of the first ciphertext and the second ciphertext set corresponding to the same encryption function to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then delete the data of the encrypted account information in the data table.

[0150] Since the principle of the above-mentioned device in solving the problem is similar to that of the above-mentioned method, the implementation of the above-mentioned device can refer to the implementation of the above-mentioned method, and the repeated parts will not be described again.

[0151] Based on the same inventive concept, this embodiment also provides a dual-chain blockchain data encryption and deletion system, including multiple deletion data nodes, an information chain, and an account chain; the data flow diagram of the dual-chain blockchain data encryption and deletion system is as follows. Figure 10 As shown, it may include the following steps:

[0152] Step 1001: The data node to be deleted sends a deletion request to other data nodes to be deleted;

[0153] Step 1002: After reaching a consensus on the deletion request, the data node sends a deletion request to the information chain;

[0154] Step 1003: The information chain determines whether the received deletion request meets the predetermined conditions;

[0155] Step 1004: If the deletion request meets the predetermined conditions, the information chain deletes the data in the data table according to the deletion request;

[0156] Step 1005: The information chain sends the deletion result to the deleted data node;

[0157] Step 1006: If the deletion is successful, the deleted data node sends a queryability update request to the account chain;

[0158] Step 1007: Update the queryability of deleted data nodes in the account chain.

[0159] It should be noted that, Figure 10 The detailed steps in the data flow diagram shown are consistent with the content described above, and will not be elaborated here.

[0160] like Figure 11 The diagram illustrates the structure of a computer device according to an embodiment of the present invention. The apparatus in this invention can be the computer device described in this embodiment, executing the method of the present invention as described above. The computer device 1102 may include one or more processing devices 1104, such as one or more central processing units (CPUs), each of which can implement one or more hardware threads. The computer device 1102 may also include any storage resource 1106 for storing information of any kind, such as code, settings, data, etc. Without limitation, for example, the storage resource 1106 may include any one or more combinations of the following: any type of RAM, any type of ROM, flash memory, hard disk, optical disk, etc. More generally, any storage resource can use any technology to store information. Further, any storage resource can provide volatile or non-volatile retention of information. Further, any storage resource can represent a fixed or removable component of the computer device 1102. In one case, when the processing device 1104 executes associated instructions stored in any storage resource or combination of storage resources, the computer device 1102 can perform any operation of the associated instructions. The computer device 1102 also includes one or more drive mechanisms 1108 for interacting with any storage resource, such as hard disk drive mechanism, optical disk drive mechanism, etc.

[0161] Computer device 1102 may also include an input / output module 1110 (I / O) for receiving various inputs (via input device 1112) and providing various outputs (via output device 1114). A specific output mechanism may include a presentation device 1116 and an associated graphical user interface (GUI) 1118. In other embodiments, the input / output module 1110 (I / O), input device 1112, and output device 1114 may be omitted, and the device may function solely as a computer device within a network. Computer device 1102 may also include one or more network interfaces 1120 for exchanging data with other devices via one or more communication links 1122. One or more communication buses 1124 couple the components described above together.

[0162] Communication link 1122 can be implemented in any way, such as via a local area network, a wide area network (e.g., the Internet), a point-to-point connection, or any combination thereof. Communication link 1122 may include any combination of hardwired links, wireless links, routers, gateway functions, name servers, etc., governed by any protocol or combination of protocols.

[0163] This embodiment also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method.

[0164] This embodiment also provides a computer-readable instruction, wherein when a processor executes the instruction, the program therein causes the processor to perform the above-described method.

[0165] It should be understood that in the various embodiments of this document, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this document.

[0166] It should also be understood that, in the embodiments herein, the term "and / or" is merely a description of the relationship between associated objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Additionally, the character " / " in this document generally indicates that the preceding and following associated objects have an "or" relationship.

[0167] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this document.

[0168] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0169] In the embodiments provided herein, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the couplings or direct couplings or communication connections shown or discussed may be indirect couplings or communication connections through some interfaces, devices, or units, or they may be electrical, mechanical, or other forms of connection.

[0170] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of the embodiments described herein, depending on actual needs.

[0171] Furthermore, the functional units in the various embodiments of this document can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0172] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this paper, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this paper. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0173] This document uses specific embodiments to illustrate the principles and implementation methods of this document. The descriptions of the embodiments above are only for the purpose of helping to understand the methods and core ideas of this document. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this document. Therefore, the content of this specification should not be construed as a limitation of this document.

Claims

1. A method for encrypting and deleting data in a dual-chain blockchain, characterized in that, The method, executed by multiple data deletion nodes, includes: Any data node to be deleted sends a deletion request to a predetermined number of data nodes to be deleted, and the deletion request includes a deletion list; After reaching a consensus on the deletion requests, the deletion list is encrypted, and each encryption function is constructed based on the OT protocol. The encrypted deletion list is then encrypted a second time using the respective encryption function to obtain the first ciphertext. A deletion request is generated based on the encryption function and the first ciphertext; The deletion request is sent to the information chain. After the information chain receives a deletion request that meets the predetermined conditions and passes the consensus verification of the deletion request, any on-chain node of the information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored by the information chain to obtain a second ciphertext set corresponding to the received encryption function. The intersection of the first ciphertext and the second ciphertext set corresponding to the same encryption function is obtained. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then the data of the encrypted account information is deleted from the data table. Receive the message from the information chain indicating successful deletion; Generate a queryability update request based on the account information of the deleted data node; The queryability update request is sent to the account chain to update the queryability of the account information. The queryability is used to determine whether the deleted data node can initiate a query to the information chain.

2. The method according to claim 1, characterized in that, Sending the deletion request to the information chain further includes: The deletion request is sent to the service gateway, which then publishes the deletion request to all on-chain nodes of the information chain for consensus verification. After the consensus verification of the deletion request is passed, the service gateway controls any one on-chain node to use the received encryption function to perform secondary encryption on the encrypted account information in the data table stored in the information chain.

3. The method according to claim 2, characterized in that, After sending the deletion request to the information chain, the method further includes: The service gateway determines the on-chain node that will process the deletion request in the information chain and controls the determined on-chain node to perform the deletion.

4. The method according to claim 2, characterized in that, Sending deletion requests to a predetermined number of data nodes to be deleted further includes: The deletion request and information about a predetermined number of data nodes to be deleted are sent to the service gateway, so that the service gateway forwards the deletion request to the predetermined number of data nodes to be deleted based on the information.

5. The method according to claim 1, characterized in that, After sending a queryability update request to the account chain, the method further includes: After the consensus verification of the queryability update request is passed, the on-chain nodes of the account chain update the queryability of the account information in their own stored blocks.

6. The method according to claim 1, characterized in that, The queryability includes the number of available queries.

7. The method according to claim 6, characterized in that, After sending the queryability update request to the account chain, the method further includes: The account chain increases the number of available queries for the account information.

8. A method for encrypting and deleting data in a dual-chain blockchain, characterized in that, Executed by the information chain, the method includes: The system receives deletion requests from multiple data deletion nodes. Each deletion request is initiated when any data deletion node sends a deletion application to a predetermined number of data deletion nodes. After reaching a consensus on the deletion applications, the multiple data deletion nodes encrypt the deletion list in the deletion application and construct their respective encryption functions based on the OT protocol. They then use their respective encryption functions to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext. The system is generated based on the encryption functions and the first ciphertext. Determine whether the received deletion request meets the predetermined conditions; After the received deletion request meets the predetermined conditions and the consensus verification of the deletion request is passed, any on-chain node of the control information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored in the information chain to obtain the second ciphertext set corresponding to the received encryption function. The intersection of the first ciphertext and the second ciphertext set corresponding to the same encryption function is obtained to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, the data of the encrypted account information is deleted from the data table. The successful deletion result is sent to the deleted data node, so that the deleted data node generates a queryability update request based on the account information of the deleted data node, and sends the queryability update request to the account chain, so that the account chain updates the queryability of the account information. The queryability is used to determine whether the deleted data node can initiate a query to the information chain.

9. The method according to claim 8, characterized in that, Before receiving deletion requests from multiple data deletion nodes, the method further includes: Multiple data deletion nodes send the deletion request to the service gateway; Receive the deletion request issued by the service gateway and broadcast the deletion request to all on-chain nodes of the information chain; The on-chain nodes of the information chain are controlled to perform consensus verification of the deletion request; The consensus verification result is sent to the service gateway, so that the service gateway can control any on-chain node to perform secondary encryption on the encrypted account information in the data table stored in the information chain using the received encryption function.

10. The method according to claim 9, characterized in that, After sending the consensus verification result to the service gateway, the method further includes: The service gateway determines the on-chain node that will process the deletion request in the information chain and controls the determined on-chain node to perform the deletion.

11. The method according to claim 8, characterized in that, After sending the successful deletion result to the deleted data node, the method further includes: After the consensus verification of the queryability update request is passed, the on-chain nodes of the account chain update the queryability of the account information in their own stored blocks.

12. The method according to claim 8, characterized in that, The queryability includes the number of available queries.

13. The method according to claim 12, characterized in that, After sending the successful deletion result to the deleted data node, the method further includes: The account chain increases the number of available queries for the account information.

14. A data encryption and deletion device for a dual-chain blockchain, characterized in that, include: A deletion request sending unit is used for any data node to send a deletion request to a predetermined number of data nodes to be deleted, wherein the deletion request includes a deletion list; The deletion list encryption unit is used to encrypt the deletion list after reaching an agreement on the deletion request, and to construct their respective encryption functions based on the OT protocol, and to use their respective encryption functions to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext. A deletion request generation unit is used to generate a deletion request based on the encryption function and the first ciphertext; A deletion request sending unit is used to send the deletion request to the information chain, so that after the information chain receives a deletion request that meets predetermined conditions and passes the consensus verification of the deletion request, any on-chain node of the information chain uses the received encryption function to perform secondary encryption on multiple encrypted account information in the data table stored by the information chain to obtain a second ciphertext set corresponding to the received encryption function. The first ciphertext and the second ciphertext set corresponding to the same encryption function are intersected to obtain the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then the data of the encrypted account information is deleted from the data table. The device is further configured to receive a successful deletion result sent by the information chain; generate a queryability update request based on the account information of the deleted data node; and send the queryability update request to the account chain to update the queryability of the account information, wherein the queryability is used to determine whether the deleted data node can initiate a query to the information chain.

15. A data encryption and deletion device for a dual-chain blockchain, characterized in that, include: The deletion request receiving unit is used to receive deletion requests sent by multiple deletion data nodes. The deletion request is generated when any deletion data node sends a deletion application to a predetermined number of deletion data nodes, and after reaching a consensus on the deletion application, the multiple deletion data nodes encrypt the deletion list in the deletion application, construct their own encryption functions based on the OT protocol, and use their respective encryption functions to perform secondary encryption on the encrypted deletion list to obtain the first ciphertext. The deletion request is generated based on the encryption function and the first ciphertext. The deletion request judgment unit is used to determine whether the received deletion request meets the predetermined conditions; The deletion unit is configured to, upon receiving a deletion request that meets the predetermined conditions and after the consensus verification of the deletion request is passed, control any on-chain node of the information chain to perform secondary encryption on multiple encrypted account information in the data table stored in the information chain using the received encryption function, thereby obtaining a second ciphertext set corresponding to the received encryption function, and to find the intersection of the first ciphertext and the second ciphertext set corresponding to the same encryption function, thereby obtaining the intersection result. If the second ciphertext in the intersection result of the received encryption function corresponds to the same encrypted account information, then delete the data of the encrypted account information in the data table. The device is further configured to send the result of successful deletion to the deleted data node, so that the deleted data node generates a queryability update request based on the account information of the deleted data node, and sends the queryability update request to the account chain, so that the account chain updates the queryability of the account information, wherein the queryability is used to determine whether the deleted data node can initiate a query to the information chain.

16. A dual-chain blockchain data encryption and deletion system, characterized in that, The system includes: multiple data deletion nodes and information chains; When deleting a data node, the method described in any one of claims 1-7 is executed; When the information chain is deleted, the method described in any one of claims 8-13 is executed.

17. A computer device comprising a memory, a processor, and a computer program stored in the memory, characterized in that, When the processor executes the computer program, it implements the method according to any one of claims 1 to 13.

18. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the method of any one of claims 1 to 13.

19. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the method of any one of claims 1 to 13.

Images