Computer data security storage traceability method

Abstract

The invention discloses a computer data security storage traceability method in the technical field of computer data. The method comprises the following steps: S1, dividing original data to be stored into at least one data block; s2, generating a dynamic dyeing factor and a dyeing label based on the data block, and constructing and storing a Merkel tree; s3, storing the tree root hash value for storing the Merkel tree to a preset block chain; s4, generating a to-be-verified dynamic dyeing factor and a to-be-verified dyeing label of the to-be-verified data block; s5, analyzing and judging a first verification result of the to-be-verified data block; constructing a verification Merkel tree, and analyzing and judging a second verification result of the to-be-verified data block; and S6, if both the first verification result and the second verification result of the to-be-verified data block are abnormal, judging that the to-be-verified data block is tampered. The data security storage traceability method can realize fine-grained, high-efficiency and low-cost data security storage traceability on the premise of ensuring high-level security.

Description

Technical Field

[0001] This invention relates to the field of computer data technology, and more specifically to a method for secure storage and traceability of computer data. Background Technology

[0002] With the rapid development of information technology, data security issues are becoming increasingly serious. Data breaches occur frequently, affecting everything from personal privacy to trade secrets, from government agencies to corporate organizations—no one is immune to data security threats. Data tampering and forgery also occur from time to time, with hackers using technical means to maliciously alter data, misleading decision-making and disrupting normal business processes. Furthermore, the risk of data loss and corruption is equally significant; hardware failures, software vulnerabilities, and human error can all lead to data loss or corruption, causing incalculable losses to data owners. Throughout the entire data lifecycle—from generation, storage, and transmission to use and destruction—every stage faces potential security risks. Therefore, ensuring data security has become a crucial issue that urgently needs to be addressed in the digital age, and secure data storage and traceability technologies are key means to address this challenge.

[0003] The existing computer data security storage traceability methods are secure but have low performance and coarse granularity, and lack the ability to effectively detect and locate small, continuous tampering behaviors within the data. Therefore, in order to solve the problems mentioned above, this application proposes a computer data security storage traceability method. Summary of the Invention

[0004] The purpose of this application is to provide a method for secure storage and traceability of computer data.

[0005] A method for secure storage and traceability of computer data, comprising:

[0006] Step S1: Obtain the original data to be stored, divide the original data to be stored into at least one data block, and obtain the data block association relationship of the data blocks in the original data to be stored;

[0007] Step S2: Generate dynamic coloring factors based on the data blocks; set a preset coloring algorithm, analyze the dynamic coloring factors corresponding to the data blocks according to the preset coloring algorithm, and obtain the coloring labels corresponding to the data blocks; obtain the verification relationship information between the coloring labels, and construct a storage Merkle tree based on the coloring labels corresponding to the data blocks in the original data to be stored and the verification relationship information between the coloring labels;

[0008] Step S3: Obtain the root hash value of the stored Merkle tree and store the root hash value of the stored Merkle tree in a preset blockchain; obtain the association path information of the coloring tags in the stored Merkle tree, and store the data blocks in the original data to be stored, as well as the dynamic coloring factors, coloring tags and association path information of the coloring tags corresponding to the data blocks, in an off-chain database;

[0009] Step S4: Obtain the data block to be verified, and obtain the coloring label corresponding to the data block to be verified based on the off-chain database; generate the dynamic coloring factor to be verified based on the data block to be verified, and analyze the dynamic coloring factor to be verified according to the preset coloring algorithm to obtain the coloring label to be verified corresponding to the data block to be verified.

[0010] Step S5: Perform a color tag comparison analysis between the color tag to be verified and the color tag of the data block to be verified to determine the first verification result of the data block to be verified; construct a verification Merkle tree based on the color tag to be verified and the associated path information; perform a root hash value comparison analysis between the verification Merkle tree and the stored Merkle tree to determine the second verification result of the data block to be verified.

[0011] Step S6: If both the first verification result and the second verification result of the data block to be verified are abnormal, it is determined that the data block to be verified has been tampered with.

[0012] Further, step S1 specifically includes:

[0013] Set a data block partitioning standard; divide the original data to be stored into at least one data block according to the data block partitioning standard, and obtain the adjacent order of the data blocks in the original data to be stored;

[0014] The data block association relationship is obtained based on the adjacent order of the data blocks.

[0015] Furthermore, dynamic staining factors are generated based on the data blocks, specifically as follows:

[0016] Obtain the content of the data block corresponding to the data block, and generate the content hash value corresponding to the data block based on the content of the data block;

[0017] Set the data block identifier of the data block and the dynamic random number corresponding to the data block; and obtain the adjacent coloring labels corresponding to the adjacent data blocks of the data block according to the data block association relationship;

[0018] The dynamic coloring factor of the data block is generated based on the content hash value, data block identifier, dynamic random number and adjacent coloring labels corresponding to the data block.

[0019] Furthermore, a preset coloring algorithm is set, and the dynamic coloring factors corresponding to the data blocks are analyzed based on the preset coloring algorithm to obtain the coloring labels corresponding to the data blocks, specifically:

[0020] A coloring label model is constructed based on the preset coloring algorithm;

[0021] The dynamic staining factor of the data block is input into the staining label model, and the staining label corresponding to the dynamic staining factor is generated according to the preset staining algorithm. The staining label corresponding to the data block is output according to the staining label model.

[0022] Further, the verification relationship information between the colored tags is obtained, specifically as follows:

[0023] The adjacent order of the color tags between the corresponding color tags of the data blocks is obtained based on the adjacent order of the data blocks in the data block association information;

[0024] Based on the data block content corresponding to the data block, cross-block association information between data blocks is obtained, wherein the cross-block association information is the data block verification relationship between data blocks; and based on the data block verification relationship, the color tag verification relationship between color tags is obtained.

[0025] A verification relationship graph is constructed between the corresponding color tags of the data block based on the adjacent order of the color tags and the verification relationship of the color tags, and the verification relationship information between the color tags is obtained based on the verification relationship graph.

[0026] Furthermore, a storage Merkle tree is constructed based on the coloring labels corresponding to the data blocks in the original data to be stored, and the verification relationship information between the coloring labels, specifically as follows:

[0027] Leaf nodes are generated based on the coloring labels corresponding to the data blocks, and the leaf nodes correspond to the coloring labels; and the node adjacency order of the leaf nodes is obtained based on the adjacency order of the coloring labels.

[0028] Set a preset hash algorithm; based on the preset hash algorithm and the color tag verification relationship in the verification relationship information, perform a hash operation on the leaf nodes of the color tags to obtain the hash values ​​of the non-leaf nodes and the root of the tree;

[0029] The associated path information includes the node generation path of the non-leaf nodes corresponding to the coloring labels;

[0030] A Merkle tree is constructed based on the leaf nodes, non-leaf nodes, root hash value, the adjacency order of leaf nodes, and the node generation path of non-leaf nodes.

[0031] Further, the root hash value of the stored Merkle tree is obtained, and the root hash value of the stored Merkle tree is stored in a preset blockchain, specifically as follows:

[0032] The preset blockchain adopts a consensus mechanism such as DPoS and BFT, and is used to store the root hash value.

[0033] Further, step S4 specifically includes:

[0034] Obtain the content hash value, data block identifier, dynamic random number, and adjacent coloring labels of the data block to be verified; and generate the verification dynamic coloring factor corresponding to the data block to be verified based on the content hash value, data block identifier, dynamic random number, and adjacent coloring labels of the data block to be verified.

[0035] The verification dynamic staining factor of the data block to be verified is input into the staining label model. The verification staining label corresponding to the verification dynamic staining factor is generated according to the preset staining algorithm. The verification staining label corresponding to the data block to be verified is output according to the staining label model.

[0036] Further, the coloring label of the data block to be verified is compared and analyzed with the coloring label to determine the first verification result of the data block to be verified, specifically as follows:

[0037] If the verification label of the data block to be verified is consistent with the label of the data block to be verified in the off-chain database, then the first verification result of the data block to be verified is determined to be normal.

[0038] If the verification label of the data block to be verified is inconsistent with the label of the data block to be verified in the off-chain database, then the first verification result of the data block to be verified is determined to be abnormal.

[0039] Further, a verification Merkle tree is constructed based on the coloring labels to be verified and the associated path information; the root hash value of the verification Merkle tree is compared and analyzed with the stored Merkle tree to determine the second verification result of the data block to be verified, specifically:

[0040] The associated path information includes the node generation path for storing non-leaf nodes in the Merkle tree; a verification Merkle tree is constructed based on the node generation path and the coloring labels to be verified;

[0041] If the verified Merkle tree matches the root hash value of the stored Merkle tree, then the second verification result of the data block to be verified is normal.

[0042] If the verified Merkle tree is inconsistent with the root hash value of the stored Merkle tree, then the second verification result of the data block to be verified is determined to be abnormal.

[0043] In summary, the beneficial effects of this application are as follows: Each data block in this application has an independent, context-dependent dynamic coloring label. Once tampering occurs, the system can accurately locate which one or more data blocks have been corrupted. In addition, the dynamic coloring factor includes adjacent coloring labels and dynamic random numbers, making it impossible for attackers to simultaneously tamper with consecutive data blocks and their coloring labels without being detected. On-chain anchoring ensures the immutability of core verification information, and the setting of dynamic random numbers allows the coloring labels to be different each time they are stored, increasing the difficulty of attacks and adapting to the needs of different security levels. Finally, in terms of data storage, the massive raw data is stored in an off-chain database of a pre-defined blockchain, with only a tiny root hash value stored on the pre-defined blockchain, balancing data security and data performance, making it suitable for massive data scenarios. Attached Figure Description

[0044] To more clearly illustrate the technical solutions of the embodiments of this application, some of the accompanying drawings in the embodiments of this application will be briefly described below. It should be understood that the following drawings only show some embodiments of this application and should not be considered as a limitation on the scope of this application.

[0045] Figure 1 This is a flowchart illustrating a method for secure storage and traceability of computer data provided in this application. Detailed Implementation

[0046] The following examples and... Figure 1 This application will be described in further detail, but the implementation of this application is not limited thereto.

[0047] Reference Figure 1 The diagram shown is a flowchart illustrating a computer data security storage traceability method provided in an embodiment of this application.

[0048] A method for secure storage and traceability of computer data, comprising:

[0049] Step S1: Obtain the original data to be stored, divide the original data to be stored into at least one data block, and obtain the data block association relationship in the original data to be stored;

[0050] Step S2: Generate dynamic coloring factors based on data blocks; set a preset coloring algorithm, analyze the dynamic coloring factors corresponding to the data blocks according to the preset coloring algorithm, and obtain the coloring labels corresponding to the data blocks; obtain the verification relationship information between the coloring labels, and construct a storage Merkle tree based on the coloring labels corresponding to the data blocks in the original data to be stored and the verification relationship information between the coloring labels;

[0051] Step S3: Obtain the root hash value of the stored Merkle tree and store the root hash value of the stored Merkle tree to the preset blockchain; obtain the association path information of the coloring labels in the stored Merkle tree, and store the data blocks in the original data to be stored, as well as the dynamic coloring factors, coloring labels and association path information of the coloring labels corresponding to the data blocks, in the off-chain database.

[0052] Step S4: Obtain the data block to be verified, and obtain the coloring label corresponding to the data block to be verified based on the off-chain database; generate the dynamic coloring factor to be verified based on the data block to be verified, and analyze the dynamic coloring factor to be verified according to the preset coloring algorithm to obtain the coloring label to be verified corresponding to the data block to be verified.

[0053] Step S5: Compare and analyze the coloring labels of the data block to be verified with the coloring labels to determine the first verification result of the data block to be verified; construct a verification Merkle tree based on the coloring labels to be verified and the associated path information; compare and analyze the root hash value of the verification Merkle tree with the stored Merkle tree to determine the second verification result of the data block to be verified.

[0054] Step S6: If both the first and second verification results of the data block to be verified are abnormal, it is determined that the data block to be verified has been tampered with.

[0055] Step S1 is as follows:

[0056] Set data block partitioning criteria; divide the original data to be stored into at least one data block according to the data block partitioning criteria, and obtain the adjacent order of the data blocks in the original data to be stored;

[0057] The association relationship between data blocks is obtained based on the adjacent order of data blocks.

[0058] In some embodiments, the raw data to be stored may be patient CT scan image files that the medical image archiving system needs to store or protect;

[0059] In some embodiments, the data block partitioning criteria can be the time of each data item in the original data to be stored or the data specifications contained in the original data to be stored. For example, if the original data to be stored is a medical image archiving system, and the original data to be stored contains 50 patient CT scan image files that need to be stored, then the original data to be stored can be partitioned according to the data specifications, and the original data to be stored can be divided into 50 data blocks according to the slice order, with each data block corresponding to one patient CT scan image file; wherein the slice order can be the file time order of the patient CT scan image files.

[0060] Dynamic coloring factors are generated based on data blocks, specifically as follows:

[0061] Retrieve the content of the data block corresponding to the data block, and generate the content hash value corresponding to the data block based on the data block content;

[0062] Set the data block identifier for the data block, and the corresponding dynamic random number for the data block; and obtain the adjacent coloring labels corresponding to the adjacent data blocks of the data block according to the data block association relationship;

[0063] The dynamic coloring factor of the data block is generated based on the content hash value corresponding to the data block, the data block identifier, the dynamic random number, and the adjacent coloring labels.

[0064] In some embodiments, when generating the content hash value corresponding to the data block based on the data block content, the SHA-2 series hash algorithm or the SHA-3 hash algorithm can be used to perform hash operation on the data block content to obtain the content hash value corresponding to the data block.

[0065] In addition, the data block identifier is a unique identifier corresponding to the data block, and there is a one-to-one correspondence between the data block and the data block identifier; the dynamic random number corresponding to the data block can be set according to time, that is, the dynamic random number is related to time, the dynamic random number is specifically generated by the trusted execution environment, and the dynamic random number of each data block is different;

[0066] The dynamic coloring factor of a data block, which is generated based on the content hash value, data block identifier, dynamic random number, and adjacent coloring tags of the data block, refers to the process of concatenating the content hash value, data block identifier, dynamic random number, and adjacent coloring tags of the data block, and then performing a hash operation using a hash algorithm of the SHA-2 series or SHA-3 hash algorithm to obtain the dynamic coloring factor of the data block.

[0067] It is important to note that the adjacent color label is specifically the color label of the preceding data block. For example, if the data block is the 9th data block, then the adjacent color label is the color label of the 8th data block.

[0068] A preset coloring algorithm is set, and the dynamic coloring factors corresponding to the data blocks are analyzed based on the preset coloring algorithm to obtain the coloring labels corresponding to the data blocks, specifically:

[0069] A coloring label model is constructed based on a preset coloring algorithm;

[0070] The dynamic coloring factor of the data block is input into the coloring label model, the coloring label corresponding to the dynamic coloring factor is generated according to the preset coloring algorithm, and the coloring label corresponding to the data block is output according to the coloring label model.

[0071] In some embodiments, the preset coloring algorithm may adopt the SM3 hash function based on the national cryptographic algorithm. In this case, the coloring label can be calculated by the following formula: Coloring label = SM3 (dynamic coloring factor).

[0072] Obtain the verification relationship information between the colored labels, specifically:

[0073] Based on the adjacent order of data blocks in the data block association information, obtain the adjacent order of the coloring labels between the corresponding coloring labels of the data blocks;

[0074] Based on the content of the corresponding data block, obtain the cross-block association information between data blocks, where the cross-block association information is the data block verification relationship between data blocks; and based on the data block verification relationship, obtain the color label verification relationship between color labels.

[0075] A verification relationship graph is constructed between the corresponding color labels of the data blocks based on the adjacent order of the color labels and the verification relationship between the color labels, and the verification relationship information between the color labels is obtained based on the verification relationship graph.

[0076] In some embodiments, the adjacent order of data blocks in the data block association information is the adjacent order of the coloring labels between the corresponding coloring labels of the data blocks; the data block verification relationship between data blocks specifically refers to the verification relationship between data blocks. For example, if a new data block A1 can be obtained by verifying data block A and data block B, then the data verification relationship between data block A and data block B is that the new data block A1 is obtained from data block A and data block B; the coloring label verification relationship between coloring labels is consistent with the data block verification relationship between data blocks. For example, if data block A corresponds to coloring label A, data block B corresponds to coloring label B, and data block A1 corresponds to coloring label A1, then the coloring label verification relationship is that coloring label A1 is obtained from coloring label A and coloring label B;

[0077] The verification relationship graph contains the adjacent order of the colored labels and the verification relationship between the colored labels.

[0078] And based on the coloring labels corresponding to the data blocks in the original data to be stored, and the verification relationship information between the coloring labels, a storage Merkle tree is constructed, specifically as follows:

[0079] Leaf nodes are generated based on the coloring labels corresponding to the data blocks, and leaf nodes correspond to coloring labels; the adjacency order of leaf nodes is obtained based on the adjacency order of coloring labels.

[0080] Set a preset hash algorithm; based on the preset hash algorithm and the color tag verification relationship in the verification relationship information, perform hash operation on the leaf nodes of the color tags to obtain the hash values ​​of non-leaf nodes and the root of the tree;

[0081] The associated path information includes the node generation path of the non-leaf nodes corresponding to the coloring labels;

[0082] A Merkle tree is constructed based on leaf nodes, non-leaf nodes, the root hash value, the adjacency order of leaf nodes, and the node generation path of non-leaf nodes.

[0083] In some embodiments, there is a one-to-one correspondence between the coloring labels and leaf nodes; the preset hash algorithm can specifically adopt the SHA-2 series hash algorithm or the SHA-3 hash algorithm; for example, there is a coloring label verification relationship between coloring label A and coloring label B, data block A corresponds to leaf node A, and data block B corresponds to leaf node B, then the preset hash algorithm is used to perform a hash operation on leaf node A and leaf node B to obtain non-leaf node A1; when aggregating leaf nodes according to the preset hash algorithm, the aggregator method can be used to aggregate leaf nodes in pairs. If the number of leaf nodes is odd, the last leaf node is copied to ensure that the upper-level parent node (i.e., non-leaf node) of the leaf node can be generated by combining them in pairs.

[0084] In practical applications, the node layer containing the leaf nodes is called the leaf node layer, and the non-leaf node layer obtained by aggregating the leaf nodes is called the upper node layer of the leaf nodes. Starting from the upper node layer, two adjacent nodes are concatenated using a preset hash algorithm, and a new hash value is calculated using the preset hash algorithm, which serves as the "parent node" of these two nodes. This process is repeated upwards: adjacent nodes in the lower layer are concatenated in pairs to generate the upper parent node, until only one node remains. This node is the root hash value of the Merkle tree.

[0085] Obtain the root hash value of the stored Merkle tree and store it in a predefined blockchain, specifically:

[0086] The default blockchain uses a consensus mechanism similar to DPoS and BFT, and is used to store the root hash value.

[0087] In some embodiments, when storing data blocks in the original data to be stored, as well as the dynamic coloring factor, coloring label, and associated path information of the coloring label corresponding to the data block, in an off-chain database, the data block and the associated path information of the dynamic coloring factor, coloring label, and coloring label corresponding to the data block can be encrypted and stored in the off-chain database; when retrieving data block related information from the off-chain database, it is necessary to decrypt the information before retrieving it.

[0088] Step S4 is as follows:

[0089] Obtain the content hash value, data block identifier, dynamic random number, and adjacent coloring labels of the data block to be verified; and generate the verification dynamic coloring factor corresponding to the data block to be verified based on the content hash value, data block identifier, dynamic random number, and adjacent coloring labels of the data block to be verified.

[0090] The verification dynamic staining factor of the data block to be verified is input into the staining label model. The verification staining label corresponding to the verification dynamic staining factor is generated according to the preset staining algorithm, and the verification staining label corresponding to the data block to be verified is output according to the staining label model.

[0091] In some embodiments, generating a dynamic coloring factor for a data block based on the content hash value, data block identifier, dynamic random number, and adjacent coloring tags of the data block to be verified refers to concatenating the content hash value, data block identifier, dynamic random number, and adjacent coloring tags of the data block to be verified, and then performing a hash operation using a SHA-2 series hash algorithm or a SHA-3 hash algorithm to obtain the dynamic coloring factor of the data block to be verified. It is important to note that the adjacent coloring tag specifically refers to the coloring tag of the preceding data block to which the data block to be verified belongs. For example, if the data block to be verified is the 26th data block, then the adjacent coloring tag would be the coloring tag of the 25th data block.

[0092] The coloring labels of the data block to be verified are compared and analyzed to determine the first verification result of the data block to be verified. Specifically:

[0093] If the verification label of the data block to be verified is consistent with the label of the data block to be verified in the off-chain database, then the first verification result of the data block to be verified is considered to be normal.

[0094] If the verification label of the data block to be verified is inconsistent with the label of the data block to be verified in the off-chain database, the first verification result of the data block to be verified is determined to be abnormal.

[0095] A verification Merkle tree is constructed based on the coloring labels to be verified and the associated path information; the root hash value of the verification Merkle tree is compared and analyzed with that of the stored Merkle tree to determine the second verification result of the data block to be verified, specifically:

[0096] The associated path information includes the node generation path for storing non-leaf nodes in the Merkle tree; and the verification Merkle tree is constructed based on the node generation path and the coloring labels to be verified.

[0097] If the verified Merkle tree matches the root hash value of the stored Merkle tree, then the second verification result of the data block to be verified is considered normal.

[0098] If the verified Merkle tree does not match the root hash value of the stored Merkle tree, then the second verification result of the data block to be verified is considered abnormal.

[0099] In some embodiments, when constructing the verification Merkle tree, the original coloring label corresponding to the coloring label to be verified in the stored Merkle tree is replaced with the coloring label to be verified, while the other coloring labels and the node generation paths corresponding to each coloring label remain unchanged, and the verification Merkle tree is constructed based on the node generation paths and the coloring label to be verified.

[0100] The above are merely preferred embodiments of this application. The scope of protection of this application is not limited to the above embodiments. All technical solutions within the scope of this application's concept are within the scope of protection of this application. It should be noted that for those skilled in the art, any improvements and modifications made without departing from the principles of this application should also be considered within the scope of protection of this application.

Claims

1. A method for secure storage and traceability of computer data, characterized in that, include: Step S1: Obtain the original data to be stored, divide the original data to be stored into at least one data block, and obtain the data block association relationship of the data blocks in the original data to be stored; Step S2: Generate dynamic staining factors based on the data block; A preset coloring algorithm is set, and the dynamic coloring factor corresponding to the data block is analyzed according to the preset coloring algorithm to obtain the coloring label corresponding to the data block; the verification relationship information between the coloring labels is obtained, and a storage Merkle tree is constructed based on the coloring labels corresponding to the data blocks in the original data to be stored and the verification relationship information between the coloring labels. Step S3: Obtain the root hash value of the stored Merkle tree and store the root hash value of the stored Merkle tree in a preset blockchain; Obtain the association path information of the coloring labels in the stored Merkle tree, and store the data blocks in the original data to be stored, as well as the dynamic coloring factors, coloring labels and association path information of the coloring labels corresponding to the data blocks, into the off-chain database; Step S4: Obtain the data block to be verified, and obtain the coloring label corresponding to the data block to be verified based on the off-chain database; Based on the data block to be verified, a dynamic staining factor to be verified is generated, and the dynamic staining factor to be verified is analyzed according to a preset staining algorithm to obtain the staining label to be verified corresponding to the data block to be verified. Step S5: Perform a color tag comparison analysis on the color tags of the data block to be verified and the color tags to determine the first verification result of the data block to be verified; construct a verification Merkle tree based on the color tags to be verified and the associated path information; The root hash value of the verified Merkle tree is compared and analyzed with that of the stored Merkle tree to determine the second verification result of the data block to be verified. Step S6: If both the first verification result and the second verification result of the data block to be verified are abnormal, it is determined that the data block to be verified has been tampered with.

2. The computer data security storage traceability method according to claim 1, characterized in that, Step S1 is as follows: Set a data block partitioning standard; divide the original data to be stored into at least one data block according to the data block partitioning standard, and obtain the adjacent order of the data blocks in the original data to be stored; The data block association relationship is obtained based on the adjacent order of the data blocks.

3. The computer data security storage traceability method according to claim 2, characterized in that, Dynamic staining factors are generated based on the data blocks, specifically as follows: Obtain the content of the data block corresponding to the data block, and generate the content hash value corresponding to the data block based on the content of the data block; Set the data block identifier of the data block, and the dynamic random number corresponding to the data block; And based on the data block association relationship, obtain the adjacent coloring labels corresponding to the adjacent data blocks of the data block; The dynamic coloring factor of the data block is generated based on the content hash value, data block identifier, dynamic random number and adjacent coloring labels corresponding to the data block.

4. The computer data security storage traceability method according to claim 3, characterized in that, A preset coloring algorithm is set, and the dynamic coloring factors corresponding to the data blocks are analyzed based on the preset coloring algorithm to obtain the coloring labels corresponding to the data blocks, specifically: A coloring label model is constructed based on the preset coloring algorithm; The dynamic staining factor of the data block is input into the staining label model, and the staining label corresponding to the dynamic staining factor is generated according to the preset staining algorithm. The staining label corresponding to the data block is output according to the staining label model.

5. A method for secure storage and traceability of computer data according to claim 4, characterized in that, The verification relationship information between the colored labels is obtained as follows: The adjacent order of the color tags between the corresponding color tags of the data blocks is obtained based on the adjacent order of the data blocks in the data block association information; Based on the content of the data block corresponding to the data block, cross-block association information between data blocks is obtained, wherein the cross-block association information is the data block verification relationship between data blocks; And based on the data block verification relationship, the verification relationship between the color labels is obtained; A verification relationship graph is constructed between the corresponding color tags of the data block based on the adjacent order of the color tags and the verification relationship of the color tags, and the verification relationship information between the color tags is obtained based on the verification relationship graph.

6. A method for secure storage and traceability of computer data according to claim 5, characterized in that, And based on the coloring labels corresponding to the data blocks in the original data to be stored, and the verification relationship information between the coloring labels, a storage Merkle tree is constructed, specifically as follows: Leaf nodes are generated based on the coloring labels corresponding to the data blocks, and the leaf nodes correspond to the coloring labels; and the node adjacency order of the leaf nodes is obtained based on the adjacency order of the coloring labels. Set the preset hash algorithm; Based on the preset hash algorithm and the color tag verification relationship in the verification relationship information, the leaf nodes of the color tags are hashed to obtain the hash values ​​of the non-leaf nodes and the root of the tree. The associated path information includes the node generation path of the non-leaf nodes corresponding to the coloring labels; A Merkle tree is constructed based on the leaf nodes, non-leaf nodes, root hash value, the adjacency order of leaf nodes, and the node generation path of non-leaf nodes.

7. A method for secure storage and traceability of computer data according to claim 6, characterized in that, Obtain the root hash value of the stored Merkle tree and store it in a preset blockchain, specifically as follows: The preset blockchain adopts a consensus mechanism such as DPoS and BFT, and is used to store the root hash value.

8. A method for secure storage and traceability of computer data according to claim 7, characterized in that, Step S4 is as follows: Obtain the content hash value, data block identifier, dynamic random number, and adjacent coloring label of the data block to be verified; The verification dynamic coloring factor is generated based on the content hash value of the data block to be verified, the data block identifier, the dynamic random number, and the adjacent coloring labels. The verification dynamic staining factor of the data block to be verified is input into the staining label model. The verification staining label corresponding to the verification dynamic staining factor is generated according to the preset staining algorithm. The verification staining label corresponding to the data block to be verified is output according to the staining label model.

9. A method for secure storage and traceability of computer data according to claim 8, characterized in that, The coloring label of the data block to be verified is compared and analyzed with the coloring label to determine the first verification result of the data block to be verified. Specifically: If the verification label of the data block to be verified is consistent with the label of the data block to be verified in the off-chain database, then the first verification result of the data block to be verified is determined to be normal. If the verification label of the data block to be verified is inconsistent with the label of the data block to be verified in the off-chain database, then the first verification result of the data block to be verified is determined to be abnormal.

10. A method for secure storage and traceability of computer data according to claim 9, characterized in that, A verification Merkle tree is constructed based on the coloring labels to be verified and the associated path information; the root hash value of the verification Merkle tree is compared and analyzed with that of the stored Merkle tree to determine the second verification result of the data block to be verified, specifically as follows: The associated path information includes the node generation path for storing non-leaf nodes in the Merkle tree; a verification Merkle tree is constructed based on the node generation path and the coloring labels to be verified; If the verified Merkle tree matches the root hash value of the stored Merkle tree, then the second verification result of the data block to be verified is normal. If the verified Merkle tree is inconsistent with the root hash value of the stored Merkle tree, then the second verification result of the data block to be verified is determined to be abnormal.

Images