A method for dynamically encrypting space-sensitive data of data trust

Abstract

The application discloses a method for dynamically encrypting sensitive data in a trusted space, and relates to the technical field of data security protection, and comprises the following steps: acquiring original sensitive data, performing a semantic decomposition operation, and determining a fragment set; acquiring the fragment set, assigning a fragment identifier to each fragment, performing a fragment initial transformation operation, and determining an initial transformation fragment set; acquiring the initial transformation fragment set, performing a fragment transformation information record generation operation; acquiring the initial transformation fragment set, performing a fragment dispersed storage operation, acquiring a transformation update period trigger signal, and performing a fragment transformation update operation; acquiring a data access request, acquiring all updated transformation fragments based on a current fragment transformation information record, and performing an inverse transformation and semantic reorganization operation to obtain restored original sensitive data. Different fragments are stored in different storage nodes, and unauthorized access of a single storage node does not affect the security of fragments on other storage nodes.

Description

Technical Field

[0001] This invention relates to the field of data security protection technology, specifically a method for dynamically encrypting sensitive data in a trusted data space. Background Technology

[0002] In a trusted data space, sensitive data needs to be stored, transferred, and accessed among multiple parties. When sensitive data is in a static storage state, it faces the risk of being obtained without authorization. Attackers may attempt to obtain sensitive data stored in the trusted data space by infiltrating storage nodes, stealing storage media, or exploiting system vulnerabilities.

[0003] Existing technologies include encrypting sensitive data as a whole and data fragmentation. Encrypting sensitive data as a whole involves storing the encrypted ciphertext data in a storage node. The effectiveness of this method depends on the strength of the encryption algorithm and the security of the key management mechanism. Once the encryption key is leaked or the encryption algorithm is broken, the stored ciphertext data can be decrypted and restored to the original sensitive data. Moreover, the ciphertext data is usually stored in a storage location as a single complete data object. After obtaining the ciphertext data object, attackers can continue to attempt to crack it in an offline environment. Data sharding divides raw data into multiple data fragments and stores each fragment in different storage nodes. When a storage node is accessed without authorization, an attacker can only obtain a portion of the data fragments stored on that node, and cannot directly obtain the complete original data. Existing data sharding technologies typically employ fixed sharding rules. That is, for a given set of raw data, the partitioning boundaries, the number of partitions, and the storage location of each fragment are determined when the data is stored and remain unchanged. If an attacker continuously observes and analyzes multiple storage nodes over a long period, they may deduce the sharding rules and locate the storage locations of each fragment, thereby obtaining a sufficient number of fragments to piece together and recover the original data. Furthermore, each data fragment itself is stored either in its original form or in a form transformed in a fixed way. The fragment content does not change during the storage period. Once the access permissions of a storage node are breached, the fragment content stored on that node is exposed. Summary of the Invention

[0004] Existing methods do not constrain the relationship between the partition boundaries and semantic units when dividing data segments, which means that a single segment may contain relatively complete semantic information. Attackers can obtain some sensitive content by obtaining one or a few segments. In order to address the shortcomings of the existing technology, this invention provides a method for dynamically encrypting sensitive data in a trusted data space.

[0005] To achieve the above objectives, the present invention provides the following technical solution: a method for dynamically encrypting sensitive data in a trusted data space, specifically comprising the following steps: S1. Obtain the original sensitive data, perform semantic decomposition operation, and determine the fragment set, which includes the first fragment, the second fragment, up to the Nth fragment; S2. Obtain the fragment set, assign fragment identifiers to each fragment and perform initial fragment transformation operation to determine the initial transformed fragment set; S3. Obtain the initial set of transformed fragments, perform the fragment transformed information record generation operation, and determine the fragment transformed information record; S4. Obtain the initial transformation fragment set, perform fragment dispersion storage operation, and store each initial transformation fragment in a different storage node; S5. Obtain the transformation update cycle trigger signal, execute the fragment transformation update operation, and update the transformation parameters of each fragment and the corresponding fragment transformation information record. S6. Obtain the data access request, obtain all updated transformation fragments based on the current fragment transformation information record, and perform inverse transformation and semantic recombination operations to obtain the restored original sensitive data.

[0006] Preferably, in S1, N is the total number of fragments generated by the semantic decomposition operation. The semantic units contained in the original sensitive data are identified. A semantic unit refers to a component in the original sensitive data that can independently express the meaning of an information. The basis for identifying semantic units includes the structural separators, data type definitions, and logical dependencies between fields contained in the original sensitive data itself. The identified semantic units are arranged in the order of their appearance in the original sensitive data to form a semantic unit sequence. When two adjacent semantic units belong to different semantic domains, the boundary between the two adjacent semantic units is determined. When there is a master-slave modification relationship between two adjacent semantic units, and the presence or absence of the modifying semantic unit does not change the basic semantic orientation of the modified semantic unit, the modifying semantic unit and the modified semantic unit are classified into the same fragment. The boundary between adjacent semantic units that do not have this relationship is determined. When the length of a semantic unit exceeds a preset length threshold and the semantic unit can be split into two sub-semantic units with relatively independent meanings, the boundary between the sub-semantic units within the semantic unit is determined. Semantic units located between two adjacent partition boundaries are extracted as fragments until all semantic units in the semantic unit sequence are assigned to unique corresponding fragments, forming a fragment set. For each fragment in the fragment set, perform semantic integrity verification. Integrity verification is to determine whether the semantic units contained in the fragment simultaneously contain the semantic action initiator identifier, semantic action operation description, and semantic action target description. If any of the three is missing and that information is not included in any semantic unit within the fragment, the fragment is determined to not contain complete semantic information. If a fragment is determined to contain complete semantic information, the position of the partition boundary adjacent to the fragment is adjusted and the fragment partitioning and semantic integrity verification are re-executed until each fragment in the fragment set is verified to not contain complete semantic information.

[0007] Preferably, in step S2, a first fragment identifier is generated for the first fragment, a second fragment identifier is generated for the second fragment, and so on, until an Nth fragment identifier is generated for the Nth fragment. Each fragment identifier is unique in the trusted data space, and a one-to-one mapping relationship between the fragment identifier and the corresponding fragment is established. For each fragment in the fragment set, obtain the fragment identifier corresponding to each fragment, and input the fragment identifier and the transformation seed value maintained in the trusted data space into the one-way mapping function to generate the transformation parameters corresponding to the fragment. The transformation behavior type is selected based on the bit sequence value of the first position interval in the transformation parameters, the number of execution rounds of the transformation behavior is determined based on the bit sequence value of the second position interval in the transformation parameters, and the execution order of each transformation behavior is determined based on the bit sequence value of the third position interval in the transformation parameters. The transformation behavior type includes at least two of the following: bit order rearrangement behavior, data substitution behavior, and XOR obfuscation behavior. According to the selected transformation behavior type, execution round and execution order, the fragment data content is transformed to obtain the initial transformed fragment, until the first initial transformed fragment corresponding to the first fragment, the second initial transformed fragment corresponding to the second fragment, and so on up to the Nth initial transformed fragment corresponding to the Nth fragment, forming an initial transformed fragment set; The fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment in the initial transformation fragment set are recorded in the fragment transformation information record.

[0008] Preferably, in step S3, the fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment in the initial transformation fragment set are obtained. A corresponding entry is constructed for each initial transformation fragment. The entry includes a fragment identifier field, a current transformation parameter field, and a current storage location field. The fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment are written into the corresponding fields of the corresponding entry, until the first entry corresponding to the first initial transformation fragment, the second entry corresponding to the second initial transformation fragment, and so on up to the Nth entry corresponding to the Nth initial transformation fragment are obtained. The first, second, and Nth entries are combined to form a fragment transformation information record. The fragment transformation information record is written into the record storage area in the trusted data space. The record storage area and the storage node used to store the initial transformation fragment data are distinguished from each other on the physical medium or logical partition. A record identifier is assigned to the fragment transformation information record, and a mapping relationship is established between the record identifier and the data identifier of the original sensitive data.

[0009] Preferably, in step S4, a first storage node is selected from the list of available storage nodes in the trusted data space, the first initial transformation fragment is written into the first storage node, and the first storage location corresponding to the first storage node is recorded in the fragment transformation information record in the entry corresponding to the first initial transformation fragment. Select a second storage node from the list of available storage nodes. The second storage node is different from the first storage node in terms of physical location or logical partition. Write the second initial transformation fragment into the second storage node and record the second storage location corresponding to the second storage node in the fragment transformation information record in the entry corresponding to the second initial transformation fragment. Select the Nth storage node from the list of available storage nodes, write the Nth initial transformation fragment into the Nth storage node, and record the Nth storage location corresponding to the Nth storage node in the fragment transformation information record within the entry corresponding to the Nth initial transformation fragment.

[0010] Preferably, in step S5, the currently valid fragment transformation information record is obtained, and the fragment identifier and current transformation parameters corresponding to each fragment are extracted from the currently valid fragment transformation information record. The fragment transformation information record includes a first entry corresponding to the first initial transformation fragment, a second entry corresponding to the second initial transformation fragment, up to the Nth entry corresponding to the Nth initial transformation fragment, and each entry records the fragment identifier, transformation parameters and storage location of the corresponding fragment. For each fragment, the fragment identifier, the transformation seed value maintained in the trusted data space, and the update round identifier representing the order of this update operation are input into the one-way mapping function to generate the update transformation parameters. The updated transformation parameters are numerically different from the current transformation parameters. The update transformation behavior type is selected based on the bit sequence value of the first position interval in the update transformation parameters, the execution round of the update transformation behavior is determined based on the bit sequence value of the second position interval in the update transformation parameters, and the execution order of each update transformation behavior is determined based on the bit sequence value of the third position interval in the update transformation parameters. The update transformation behavior type includes at least two of the following: bit order rearrangement behavior, data substitution behavior, and XOR obfuscation behavior. According to the selected update transformation behavior type, execution round and execution order, the current data content of the corresponding fragment is transformed to obtain the update transformation fragment, until the first update transformation fragment corresponding to the first initial transformation fragment, the second update transformation fragment corresponding to the second initial transformation fragment, and so on until the Nth update transformation fragment corresponding to the Nth initial transformation fragment is obtained. Get all updated transformation fragments, modify the transformation parameter field in each entry of the fragment transformation information record from the current transformation parameter to the corresponding updated transformation parameter, generate the updated fragment transformation information record, and mark the fragment transformation information record before the update as history. Obtain a data access request, which includes the requester's identity and access authorization credentials. After verifying the validity of the access authorization credentials, obtain the updated fragment transformation information record. Based on the storage location of each entry in the updated fragment transformation information record, obtain the first updated transformation fragment, the second updated transformation fragment, and so on up to the Nth updated transformation fragment from the corresponding storage node.

[0011] Preferably, in step S6, a data access request is obtained, which includes the requester's identity identifier and access authorization credentials. After verifying the validity of the access authorization credentials, the currently valid fragment transformation information record is obtained. Based on the storage location of each entry record in the currently valid fragment transformation information record, all updated transformation fragments are obtained from the corresponding storage node. Based on the transformation parameters of each entry in the currently valid fragment transformation information record, the inverse transformation operation is performed on each updated transformation fragment to obtain the restored fragment set. The restored fragment set is then subjected to semantic recombination operation in reverse order of semantic decomposition operation to obtain the restored original sensitive data.

[0012] This invention provides a method for dynamically encrypting sensitive data in a trusted data space, which has the following beneficial effects: This invention divides the original sensitive data into multiple semantic fragments through semantic decomposition. Since the information content carried by a single fragment does not constitute a complete semantic statement, it is impossible to restore the complete semantic content of the original sensitive data. The initial transformation operation is performed on each fragment, and at least one of the transformation behavior type, execution rounds, or execution order experienced by each fragment is different, so that the initial transformed fragments are unrelated in terms of transformation form. Different fragments of the same original sensitive data exhibit different transformation forms. The transformation form of other fragments cannot be inferred from a single fragment and its transformation parameters. In fragmented distributed storage operations, different fragments are stored on different storage nodes. Each storage node is located in a different physical location or in a different logical partition of the trusted data space. The fragments are stored in a distributed manner, and unauthorized access to a single storage node does not affect the security of fragments on other storage nodes. Attached Figure Description

[0013] Figure 1 This is a flowchart of the present invention. Detailed Implementation

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

[0015] Please see Figure 1 This invention provides a method for dynamically encrypting sensitive data in a trusted space, comprising the following steps: S1. Obtain the original sensitive data, perform semantic decomposition operation, and determine the fragment set, which includes the first fragment, the second fragment, up to the Nth fragment; Furthermore, in S1, N is the total number of fragments generated by the semantic decomposition operation. The semantic units contained in the original sensitive data are identified. A semantic unit refers to a component in the original sensitive data that can independently express the meaning of a piece of information. The basis for identifying semantic units includes the structural separators, data type definitions, and logical dependencies between fields contained in the original sensitive data itself. The identified semantic units are arranged in the order of their appearance in the original sensitive data to form a semantic unit sequence. When two adjacent semantic units belong to different semantic domains, the boundary between the two adjacent semantic units is determined. When there is a master-slave modification relationship between two adjacent semantic units, and the presence or absence of the modifying semantic unit does not change the basic semantic orientation of the modified semantic unit, the modifying semantic unit and the modified semantic unit are classified into the same fragment. The boundary between adjacent semantic units that do not have this relationship is determined. When the length of a semantic unit exceeds a preset length threshold and the semantic unit can be split into two sub-semantic units with relatively independent meanings, the boundary between the sub-semantic units within the semantic unit is determined. Semantic units located between two adjacent partition boundaries are extracted as fragments until all semantic units in the semantic unit sequence are assigned to unique corresponding fragments, forming a fragment set. For each fragment in the fragment set, perform semantic integrity verification. Integrity verification is to determine whether the semantic units contained in the fragment simultaneously contain the semantic action initiator identifier, semantic action operation description, and semantic action target description. If any of the three is missing and that information is not included in any semantic unit within the fragment, the fragment is determined to not contain complete semantic information. If a fragment is determined to contain complete semantic information, the position of the partition boundary adjacent to the fragment is adjusted and the fragment partitioning and semantic integrity verification are re-executed until each fragment in the fragment set is verified to not contain complete semantic information.

[0016] It should be noted that raw sensitive data is a data record that exists in a structured or semi-structured form and carries specific semantic content, such as a record in a database, a paragraph in a text file, or an object node in a data exchange format. Semantic decomposition is the process of identifying and labeling the semantic units in raw sensitive data. A semantic unit refers to the smallest component in the original sensitive data that can independently express the meaning of a complete piece of information, such as a complete field name and field value pair, a natural statement with a subject-verb-object structure, or a closed markup language element. The basis for identifying semantic units includes, but is not limited to, the structural separators, data type definitions, and logical dependencies between fields contained in the original sensitive data itself. After identifying all semantic units, the semantic units contained in the original sensitive data are arranged in their original order of appearance to form a semantic unit sequence. The semantic unit sequence retains the relative order relationship between the semantic units in the original sensitive data, but has not yet been decomposed. Based on the obtained semantic unit sequence, the semantic unit partitioning boundary determination operation is performed. The partitioning boundary determination operation is used to divide the continuous semantic unit sequence into multiple non-overlapping segments, and each segment is processed as an independent semantic fragment. Boundary determination uses semantic units as the smallest indivisible unit. It then determines whether pre-defined partitioning conditions are met between two adjacent semantic units. These pre-defined partitioning conditions include: The first dividing condition is that when two adjacent semantic units belong to different semantic domains, the boundary between them is determined. The second dividing condition is that when there is a master-slave modification relationship between two adjacent semantic units and the presence or absence of the modifying semantic unit does not change the basic semantic orientation of the modified semantic unit, the modifying semantic unit and the modified semantic unit are classified into the same fragment, while the adjacent semantic units that do not have this relationship are determined as the dividing boundary. The third dividing condition is that when the length of a semantic unit exceeds a preset length threshold, and the semantic unit itself can be further divided into two sub-semantic units with relatively independent meanings, then the dividing boundary is determined between the sub-semantic units within the semantic unit. By traversing all adjacent positions in the semantic unit sequence one by one and judging according to the above division conditions, multiple division boundary positions are finally determined. The set of continuous semantic units contained between two adjacent division boundary positions constitutes a preliminary fragment. After determining the division boundary location, the fragment generation operation is performed to extract each semantic unit and its original data representation between the first division boundary and the second division boundary, and the extraction result is recorded as an independent fragment, referred to as the first fragment. Extract the semantic units and their original data representations located between the second and third partition boundaries, and use the extraction results as the next independent fragment, denoted as the second fragment; Traverse the entire sequence of semantic units and assign each semantic unit in the sequence to a unique fragment, thereby obtaining a fragment set. The fragment set contains the first fragment, the second fragment, up to the Nth fragment, where N is the total number of fragments generated by this semantic decomposition operation. Each fragment exists in the form of an independently storable data block. The fragment includes the original data fragments of the semantic units it contains and the relative arrangement order of each semantic unit within the fragment. The semantic integrity verification operation is performed on each fragment in the fragment set one by one. For the first fragment, all the semantic units contained therein are taken as the object to be verified. It is determined whether the object to be verified can independently constitute a complete semantic statement. The basis for the judgment is whether the object to be verified contains the initiator identifier of a semantic action, the operation description of the semantic action itself, and the description of the target of the semantic action. If any of the above three elements is missing, and the information is not included in any semantic unit inside the fragment, then the first fragment is determined not to contain complete semantic information. For the second fragment and other fragments, the same verification method is used. If a fragment is determined to contain complete semantic information during verification, it indicates that the selection of the fragment division boundary has failed to effectively sever the semantic dependency relationship. At this time, the division boundary determination operation should be backtracked, the position of the division boundary adjacent to the fragment should be adjusted, and the fragment generation operation and semantic integrity verification operation should be re-executed until every fragment in the fragment set is verified to not contain complete semantic information.

[0017] S2. Obtain the fragment set, assign fragment identifiers to each fragment and perform initial fragment transformation operation to determine the initial transformed fragment set; Furthermore, in S2, a first fragment identifier is generated for the first fragment, a second fragment identifier is generated for the second fragment, and so on, until an Nth fragment identifier is generated for the Nth fragment. Each fragment identifier is unique in the trusted data space, and a one-to-one mapping relationship between the fragment identifier and the corresponding fragment is established. For each fragment in the fragment set, obtain the fragment identifier corresponding to each fragment, and input the fragment identifier and the transformation seed value maintained in the trusted data space into the one-way mapping function to generate the transformation parameters corresponding to the fragment. The transformation behavior type is selected based on the bit sequence value of the first position interval in the transformation parameters, the number of execution rounds of the transformation behavior is determined based on the bit sequence value of the second position interval in the transformation parameters, and the execution order of each transformation behavior is determined based on the bit sequence value of the third position interval in the transformation parameters. The transformation behavior type includes at least two of the following: bit order rearrangement behavior, data substitution behavior, and XOR obfuscation behavior. According to the selected transformation behavior type, execution round and execution order, the fragment data content is transformed to obtain the initial transformed fragment, until the first initial transformed fragment corresponding to the first fragment, the second initial transformed fragment corresponding to the second fragment, and so on up to the Nth initial transformed fragment corresponding to the Nth fragment, forming an initial transformed fragment set; The fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment in the initial transformation fragment set are recorded in the fragment transformation information record.

[0018] It should be noted that the first fragment identifier is generated for the first fragment. The first fragment identifier is a character sequence generated by the identifier generation module of the trusted data space. The character sequence is unique in the trusted data space. Its generation methods include encoding based on timestamp information, encoding based on the output value of the random number generator, or encoding based on fragment content summary information. Generate a second fragment identifier for the second fragment. The second fragment identifier is also generated in the same way as described above, and is ensured to be different from the first fragment identifier. Generate an Nth fragment identifier for the Nth fragment in the fragment set, until all fragments in the fragment set are assigned a different fragment identifier. A one-to-one mapping relationship is established between each fragment identifier and its corresponding fragment, and the mapping relationship is recorded in the identifier mapping table in the trusted data space; After completing the fragment identifier allocation operation, the initial fragment transformation operation is performed for each fragment in the fragment set. The initial fragment transformation operation refers to applying transformation processing to the data content currently contained in the fragment to change the external appearance of the fragment during storage and transmission, while ensuring that the fragment can be restored to the data content before the transformation processing is applied after the inverse transformation. For the first fragment, the first fragment identifier corresponding to the first fragment is obtained, and the first fragment identifier is used as one of the inputs to the transformation parameter generation operation. The transformation parameter generation operation generates first transformation parameters based on the first fragment identifier and the transformation seed value maintained in the trusted data space through a one-way mapping function. The first transformation parameters are used to control the type, order, and round of transformation behavior applied to the first fragment data content. Based on the first transformation parameter, a transformation behavior selection and execution operation is performed on the data content of the first fragment. According to the value of the bit sequence located in the first position interval in the first transformation parameter, the first transformation behavior type is determined from the transformation behavior set. The transformation behavior set contains at least two different transformation behaviors, such as bit order rearrangement behavior, which swaps the positions of each data unit in the fragment data content according to the rearrangement sequence specified by the transformation parameter; data substitution behavior, which replaces a specific data unit in the fragment data content with another data unit according to the substitution mapping table specified by the transformation parameter; and XOR obfuscation behavior, which performs an XOR logic operation bit by bit between the fragment data content and the equal-length mask sequence extracted from the transformation parameter. Based on the value of the bit sequence located in the second position interval of the first transformation parameter, the execution round of the transformation behavior is determined. Based on the value of the bit sequence located in the third position interval of the first transformation parameter, the execution order of each transformation behavior is determined. According to the determined transformation behavior type, execution round and execution order, the selected transformation behavior is applied to the data content of the first fragment in sequence to obtain the first initial transformation fragment. Using the same method as for processing the first fragment, the initial fragment transformation operation is performed on the second fragment up to the Nth fragment one by one. For the second fragment, the second fragment identifier is obtained, and the second transformation parameter is generated through a one-way mapping function based on the second fragment identifier and the transformation seed value maintained in the trusted data space. Based on the bit sequence values ​​of the corresponding position interval in the second transformation parameters, determine the transformation behavior type, execution round and execution order applied to the second fragment, and apply the corresponding transformation behavior to the data content of the second fragment to obtain the second initial transformation fragment, and so on, until the Nth initial transformation fragment is obtained. After all fragments have completed the initial transformation operation, the obtained first initial transformation fragment, second initial transformation fragment, and so on up to the Nth initial transformation fragment are combined to form an initial transformation fragment set. Each initial transformation fragment in the initial transformation fragment set is associated with its corresponding fragment identifier.

[0019] S3. Obtain the initial set of transformed fragments, perform the fragment transformed information record generation operation, and determine the fragment transformed information record; Furthermore, in step S3, the fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment in the initial transformation fragment set are obtained. A corresponding entry is constructed for each initial transformation fragment. The entry includes a fragment identifier field, a current transformation parameter field, and a current storage location field. The fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment are written into the corresponding fields of the corresponding entry, until the first entry corresponding to the first initial transformation fragment, the second entry corresponding to the second initial transformation fragment, and so on up to the Nth entry corresponding to the Nth initial transformation fragment are obtained. The first entry, the second entry, and so on up to the Nth entry are combined to form a fragment transformation information record. The fragment transformation information record is written into the record storage area in the trusted data space. The record storage area and the storage node used to store the initial transformation fragment data are distinguished from each other on the physical medium or logical partition. A record identifier is assigned to the fragment transformation information record, and a mapping relationship is established between the record identifier and the data identifier of the original sensitive data.

[0020] It should be noted that for each initial transformation fragment in the initial transformation fragment set, a corresponding record entry is constructed. Taking the first initial transformation fragment as an example, the first entry is constructed. The first entry includes at least the first fragment identifier field, the first current transformation parameter field, and the first current storage location field. The first fragment identifier field is used to write the first fragment identifier, and the content of the field is completely consistent with the character sequence generated for the first fragment in the fragment identifier allocation operation. The first current transformation parameter field is used to write the first transformation parameter, and the first current storage location field is used to write the first storage location. The first storage location points to the actual storage address of the first initial transformation fragment in the trusted data space. The same method is used to construct a second entry for the second initial transformation fragment. The second entry includes a second fragment identifier field, a second current transformation parameter field, and a second current storage location field. This process continues until an Nth entry is constructed for the Nth initial transformation fragment. After all entries are constructed, the first entry, the second entry, and so on up to the Nth entry are combined according to the order of the fragment identifiers or according to the original arrangement order of the fragments in the initial transformation fragment set to form a fragment transformation information record. The fragment transformation information record is a structured data set, which is composed of entries as the basic unit. Each entry independently records the fragment identifier of an initial transformation fragment, the current transformation parameters, and the current storage location. The assembled fragment transformation information record is recorded as an independent data unit and written into a specially designated record storage area in the trusted data space. The record storage area is a storage area in the trusted data space allocated to store metadata information generated during various data protection processes. When the fragment transformation information record is written into the record storage area, a record identifier is assigned to the fragment transformation information record. The record identifier is used to uniquely identify the fragment transformation information record in the record storage area. S4. Obtain the initial transformation fragment set, perform fragment dispersion storage operation, and store each initial transformation fragment in a different storage node; Furthermore, in step S4, a first storage node is selected from the list of available storage nodes in the trusted data space, the first initial transformation fragment is written into the first storage node, and the first storage location corresponding to the first storage node is recorded in the fragment transformation information record within the entry corresponding to the first initial transformation fragment. Select a second storage node from the list of available storage nodes. The second storage node is different from the first storage node in terms of physical location or logical partition. Write the second initial transformation fragment into the second storage node and record the second storage location corresponding to the second storage node in the fragment transformation information record in the entry corresponding to the second initial transformation fragment. Select the Nth storage node from the list of available storage nodes, write the Nth initial transformation fragment into the Nth storage node, and record the Nth storage location corresponding to the Nth storage node in the fragment transformation information record within the entry corresponding to the Nth initial transformation fragment.

[0021] It should be noted that the selection of a storage node as the first storage node from the list of available storage nodes in the trusted data space is based on factors such as the current load status of the storage node, the network distance between the storage node and the data access requester, and whether the physical location of the storage node is different from the physical location where the second initial transformation fragment is to be stored. After selection, the node identifier, network address and storage path within the first storage node are combined to form the first storage location. Then, a write operation is performed to write the data content of the first initial transformation fragment into a binary data block in the specified storage path of the first storage node. After the write operation is completed, the storage behavior of the first initial transformation fragment on the first storage node is completed. The first storage location is backfilled into the entry corresponding to the first initial transformed fragment in the fragment transformation information record, and the current storage location field of the entry is written to establish a mapping association between the first fragment identifier and the first storage location; After the first initial transformation fragment is stored, the storage location selection and writing operation is performed on the second initial transformation fragment. A storage node is selected from the list of available storage nodes as the second storage node. When selecting the second storage node, different constraints than those of the first storage node must be followed. The constraints include: the second storage node and the first storage node are physically located in different physical devices or different physical data centers, or logically belong to storage areas controlled by different management domains; After selecting the second storage node, combine the relevant information of the second storage node to form the second storage location, write the data content of the second initial transformation fragment into the second storage node, and after writing is completed, fill the second storage location back into the current storage location field of the entry corresponding to the second initial transformation fragment in the fragment transformation information record; The storage location selection and writing operations are performed sequentially on the third initial transformation fragment, the fourth initial transformation fragment, and up to the Nth initial transformation fragment. For the Nth initial transformation fragment, the Nth storage node is selected from the list of available storage nodes as its storage location. If the number N of initial transformation fragments is greater than the total number of storage nodes in the available storage node list, then multiple initial transformation fragments are allowed to be stored in the same storage node. After the Nth initial transformation fragment is written to the Nth storage node, the Nth storage location is backfilled into the current storage location field of the entry corresponding to the Nth initial transformation fragment in the fragment transformation information record. S5. Obtain the transformation update cycle trigger signal, execute the fragment transformation update operation, and update the transformation parameters of each fragment and the corresponding fragment transformation information record. Furthermore, in S5, the currently valid fragment transformation information record is obtained, and the fragment identifier and current transformation parameters corresponding to each fragment are extracted from the currently valid fragment transformation information record. The fragment transformation information record includes the first entry corresponding to the first initial transformation fragment, the second entry corresponding to the second initial transformation fragment, up to the Nth entry corresponding to the Nth initial transformation fragment. Each entry records the fragment identifier, transformation parameters and storage location of the corresponding fragment. For each fragment, the fragment identifier, the transformation seed value maintained in the trusted data space, and the update round identifier representing the order of this update operation are input into the one-way mapping function to generate the update transformation parameters. The updated transformation parameters are numerically different from the current transformation parameters. The update transformation behavior type is selected based on the bit sequence value of the first position interval in the update transformation parameters, the execution round of the update transformation behavior is determined based on the bit sequence value of the second position interval in the update transformation parameters, and the execution order of each update transformation behavior is determined based on the bit sequence value of the third position interval in the update transformation parameters. The update transformation behavior type includes at least two of the following: bit order rearrangement behavior, data substitution behavior, and XOR obfuscation behavior. According to the selected update transformation behavior type, execution round and execution order, the current data content of the corresponding fragment is transformed to obtain the update transformation fragment, until the first update transformation fragment corresponding to the first initial transformation fragment, the second update transformation fragment corresponding to the second initial transformation fragment, and so on until the Nth update transformation fragment corresponding to the Nth initial transformation fragment is obtained. Get all updated transformation fragments, modify the transformation parameter field in each entry of the fragment transformation information record from the current transformation parameter to the corresponding updated transformation parameter, generate the updated fragment transformation information record, and mark the fragment transformation information record before the update as history. Obtain a data access request, which includes the requester's identity and access authorization credentials. After verifying the validity of the access authorization credentials, obtain the updated fragment transformation information record. Based on the storage location of each entry in the updated fragment transformation information record, obtain the first updated transformation fragment, the second updated transformation fragment, and so on up to the Nth updated transformation fragment from the corresponding storage node.

[0022] It should be noted that the transformation update cycle trigger signal is issued periodically according to a preset time interval. The duration of the time interval is determined during the initialization phase of the trusted data space, for example, in hours or days. When it is determined that the difference between the current time and the time of the last fragment transformation morphology update operation reaches or exceeds the time interval, the transformation update cycle trigger signal is generated and sent to the processing unit responsible for performing the fragment transformation morphology update operation. After obtaining the transformation update cycle trigger signal, the processing unit starts the fragment transformation morphology update process. After obtaining the transformation update cycle trigger signal, the fragment transformation mode update operation is performed to obtain the currently valid fragment transformation information record. The currently valid fragment transformation information record refers to the latest version of the fragment transformation information record stored in the record storage area and not marked as a historical record. Each entry is read sequentially from the fragment transformation information record to obtain the current fragment identifier, current transformation parameters, and current storage location of each fragment. For the first entry corresponding to the first initial transformation fragment, the first fragment identifier and the first current transformation parameter are extracted. For the second entry corresponding to the second initial transformation fragment, the second fragment identifier and the second current transformation parameter are extracted. The Nth fragment identifier and the Nth current transformation parameter are also extracted. Based on the current transformation parameters of each fragment, the transformation state of each fragment before this update can be determined. The first fragment identifier is obtained, and it is input into a one-way mapping function along with the transformation seed value maintained in the trusted data space. An update round identifier, representing the sequence of the current update operation, is appended to this input. This update round identifier can be, for example, a cumulative update count since the initial transformation operation, or a timestamp corresponding to the current system time. The one-way mapping function calculates the first update transformation parameters based on the first fragment identifier, the transformation seed value, and the update round identifier. Based on the bit sequence values ​​of the first position interval in the first update transformation parameters, the type of the first update transformation behavior is determined from the set of transformation behaviors. Based on the bit sequence values ​​of the second position interval, the execution round of the first update transformation behavior is determined. Based on the bit sequence values ​​of the third position interval, the execution order of each transformation behavior is determined. A transformation operation is applied to the data content of the first initial transformation fragment. The transformation operation is re-executed based on the current data content of the first initial transformation fragment, rather than based on the original fragment. That is, a new transformation process is superimposed on the existing transformation form of the first initial transformation fragment to generate the first update transformation fragment. For each of the second initial transformation fragments up to the Nth initial transformation fragment, generate the second updated transformation parameters up to the Nth updated transformation parameters, and perform the update transformation operation on each fragment to obtain the second updated transformation fragments up to the Nth updated transformation fragments, until all fragments are updated. After each updated transform fragment is generated, its data content is written back to its original storage node, overwriting the corresponding initial transform fragment data. After all fragments have been updated, the fragment transformation information record update phase begins, where the new transformation parameters corresponding to all updated and transformed fragments are obtained, namely the first updated transformation parameter, the second updated transformation parameter, and the Nth updated transformation parameter. For the first updated transformation fragment, locate the entry corresponding to its first fragment identifier in the fragment transformation information record, and modify the transformation parameter field in the entry from the first current transformation parameter to the first updated transformation parameter; If the updated transform fragment is written to a new storage location after it is generated, then the storage location field in that entry will be changed from the original storage location to the new storage location. Using the same method, update the transformation parameter field and storage location field in the second and Nth entries sequentially. After all entries are updated, generate the updated fragment transformation information record, write the updated fragment transformation information record as the new valid version to the record storage area, assign a new record version identifier, and maintain the effective mapping relationship between it and the data identifier of the original sensitive data. Mark the original fragment transformation information record before the update as a historical record.

[0023] S6. Obtain the data access request, obtain all updated transformation fragments based on the current fragment transformation information record, and perform inverse transformation and semantic recombination operations to obtain the restored original sensitive data.

[0024] Furthermore, in S6, a data access request is obtained, which includes the requester's identity identifier and access authorization credentials. After verifying the validity of the access authorization credentials, the currently valid fragment transformation information record is obtained. Based on the storage location of each entry record in the currently valid fragment transformation information record, all updated transformation fragments are obtained from the corresponding storage node. Based on the transformation parameters of each entry in the currently valid fragment transformation information record, the inverse transformation operation is performed on each updated transformation fragment to obtain the restored fragment set. The restored fragment set is then subjected to semantic recombination operation in reverse order of semantic decomposition operation to obtain the restored original sensitive data.

[0025] It should be noted that the data access request includes the requester's identity and access authorization credentials. The validity of the access authorization credentials is verified, including whether the credential issuer is a trusted authorization center, whether the credential is valid, and whether the access permissions declared in the credential include read permissions for the target data. After verification, obtain the currently valid fragment transformation information record, that is, the latest version of the fragment transformation information record stored in the record storage area and not marked as a history record. Based on the current storage location information of each entry record in the fragment transformation information record, initiate a data read request to the first storage node to obtain the first updated transformation fragment, initiate a data read request to the second storage node to obtain the second updated transformation fragment, and obtain the Nth updated transformation fragment from the Nth storage node. All update transformation fragments obtained from each storage node are gathered into a temporary processing area in the trusted data space. Based on the update transformation parameters recorded in each entry of the fragment transformation information record, the inverse transformation operation is performed on each update transformation fragment one by one. The transformation behavior type, execution round and execution order are determined according to the update transformation parameters. The reverse bit order rearrangement behavior, reverse data substitution behavior or reverse XOR obfuscation behavior are performed in the reverse order of the transformation operation to obtain the first restored fragment, the second restored fragment and the Nth restored fragment. All restored fragments are extracted sequentially according to the semantic unit splitting boundaries recorded in the semantic decomposition operation and the original arrangement order of each semantic unit in the original sensitive data. The semantic units in each restored fragment are then spliced ​​together to restore the complete data that is consistent with the content of the original sensitive data. This complete data is the restored original sensitive data, which is then returned to the data access requester.

[0026] The specific steps for performing the inverse transform operation on the update transform fragment are as follows: Obtain the update transformation fragment to be executed inverse transformation operation and the update transformation parameters corresponding to the update transformation fragment. The update transformation parameters are parameter values ​​generated by the one-way mapping function based on the fragment identifier, transformation seed value and update round identifier when the most recent update transformation operation is performed on the fragment. The update transformation parameters are internally divided into a first position interval, a second position interval and a third position interval, which are used to record the transformation behavior type, execution round and execution order of each transformation behavior experienced by the fragment in the most recent update transformation operation, respectively. Read the bit sequence value of the first position interval in the update transformation parameters, and determine the transformation behavior type selected in the most recent update transformation operation from the transformation behavior set based on the bit sequence value. The transformation behavior type includes at least two of the following: bit order rearrangement behavior, data substitution behavior, and XOR scrambling behavior. The specific type is distinguished by different combinations of the first position interval values. Read the bit sequence values ​​of the second position interval in the update transformation parameters, determine the number of execution rounds of the transformation behavior based on the bit sequence values, read the bit sequence values ​​of the third position interval in the update transformation parameters, determine the order of each transformation behavior in multiple executions based on the bit sequence values, and parse to obtain the transformation behavior sequence. The transformation behavior sequence contains several transformation behavior entries arranged in a specific order. Each entry contains a specific transformation behavior type and its position number in the total execution rounds. In the order that is exactly the reverse of the order in which each transformation behavior appears in the transformation behavior sequence, the inverse transformation behavior is executed one by one. If the transformation behavior sequence contains the first transformation behavior, the second transformation behavior, and the Mth transformation behavior in sequence from first to last, where M is equal to the number of execution rounds, the corresponding inverse transformation behavior is executed first for the Mth transformation behavior, then the corresponding inverse transformation behavior is executed for the M-1st transformation behavior, until the corresponding inverse transformation behavior is executed for the first transformation behavior. Each inverse transformation operation operates on the output of the previous inverse transformation operation. The input of the first inverse transformation operation is the update transformation fragment itself. If the transformation operation type is a bit order rearrangement operation, the corresponding inverse transformation operation is an inverse bit order rearrangement operation. If the transformation operation type is a data substitution operation, the corresponding inverse transformation operation is an inverse data substitution operation. If the transformation operation type is an XOR obfuscation operation, the corresponding inverse transformation operation is an inverse XOR obfuscation operation. The specific steps for the inverse transform behavior are as follows: Extract rearrangement sequence description information corresponding to the positional rearrangement behavior from the updated transformation parameters. The rearrangement sequence description information records how the positional rearrangement behavior applied in the transformation operation maps each data unit in the fragmented data content from the original arrangement position to the new arrangement position. The reverse order rearrangement is based on the reverse mapping of the correspondence. It moves each data unit in the current fragment data content from its current position back to the original position of the data unit before the transformation operation. It creates a temporary data buffer with the same length as the current fragment data content, traverses each target position recorded in the rearrangement sequence description information in turn, finds the source position corresponding to the target position, copies the data unit in the current fragment data content located at the target position to the source position in the temporary data buffer, and replaces the current fragment data content with the content of the temporary data buffer after the traversal is completed. Extract the substitution mapping table corresponding to the data substitution behavior from the update transformation parameters. The substitution mapping table records the correspondence of replacing the original data unit with the substitution data unit in the transformation operation. The reverse data substitution behavior replaces the target substitution data unit appearing in the current fragment data content back to its corresponding original data unit according to the reverse mapping relationship of the substitution mapping table. Read each data unit in the current fragment data content in turn, and use the data unit as a query condition to match and search in the substitution result column of the substitution mapping table. If a match is found, the current data unit is replaced with the original data unit recorded in the corresponding row of the substitution mapping table. If no match is found, the current data unit remains unchanged. The specific steps of the reverse XOR obfuscation behavior are as follows: Extract the mask sequence corresponding to the XOR scrambling behavior from the updated transformation parameters. The mask sequence is a long bit sequence used in the transformation operation to perform a bitwise XOR logic operation with the fragment data content. The inverse XOR scrambling behavior performs a bitwise XOR logic operation with the current fragment data content and the mask sequence again. Expand the current fragmented data content in binary form, and perform a bitwise XOR operation with the corresponding bits of the mask sequence to obtain the binary data content after inverse transformation. After performing all inverse transformations in reverse order, the restored fragments corresponding to the updated transformation fragments are obtained. The inverse transformation process is then performed on each of the updated transformation fragments to obtain the first restored fragment corresponding to the first updated transformation fragment, the second restored fragment corresponding to the second updated transformation fragment, and the Nth restored fragment corresponding to the Nth updated transformation fragment, thus obtaining a complete set of restored fragments.

[0027] 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, or a combination of computer software and electronic hardware. 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 application.

[0028] Those skilled in the art will 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.

[0029] In the several embodiments provided in this application, 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 coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0030] 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 this embodiment according to actual needs.

[0031] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of protection of the described technical solution.

Claims

1. A method for dynamically encrypting sensitive data in a trusted data space, characterized in that, Includes the following steps: S1. Obtain the original sensitive data, perform semantic decomposition operation, and determine the fragment set, which includes the first fragment, the second fragment, up to the Nth fragment; S2. Obtain the fragment set, assign fragment identifiers to each fragment and perform initial fragment transformation operation to determine the initial transformed fragment set; S3. Obtain the initial set of transformed fragments, perform the fragment transformed information record generation operation, and determine the fragment transformed information record; S4. Obtain the initial transformation fragment set, perform fragment dispersion storage operation, and store each initial transformation fragment in a different storage node; S5. Obtain the transformation update cycle trigger signal, execute the fragment transformation update operation, and update the transformation parameters of each fragment and the corresponding fragment transformation information record. S6. Obtain the data access request, obtain all updated transformation fragments based on the current fragment transformation information record, and perform inverse transformation and semantic recombination operations to obtain the restored original sensitive data.

2. The method for dynamically encrypting sensitive data in a trusted space according to claim 1, characterized in that, In S1, N is the total number of fragments generated by the semantic decomposition operation. The semantic units contained in the original sensitive data are identified. A semantic unit refers to a component in the original sensitive data that can independently express the meaning of a piece of information. The basis for identifying semantic units includes the structural separators, data type definitions, and logical dependencies between fields contained in the original sensitive data itself. The identified semantic units are arranged in the order of their appearance in the original sensitive data to form a semantic unit sequence. When two adjacent semantic units belong to different semantic domains, the boundary between the two adjacent semantic units is determined. When there is a master-slave modification relationship between two adjacent semantic units, and the presence or absence of the modifying semantic unit does not change the basic semantic orientation of the modified semantic unit, the modifying semantic unit and the modified semantic unit are classified into the same fragment. The boundary between adjacent semantic units that do not have this relationship is determined. When the length of a semantic unit exceeds a preset length threshold and the semantic unit can be split into two sub-semantic units with relatively independent meanings, the boundary between the sub-semantic units within the semantic unit is determined. Semantic units located between two adjacent partition boundaries are extracted as fragments until all semantic units in the semantic unit sequence are assigned to unique corresponding fragments, forming a fragment set.

3. The method for dynamically encrypting sensitive data in a trusted space according to claim 2, characterized in that, For each fragment in the fragment set, perform semantic integrity verification. Integrity verification is to determine whether the semantic units contained in the fragment simultaneously contain the semantic action initiator identifier, semantic action operation description, and semantic action target description. If any of the three is missing and that information is not included in any semantic unit within the fragment, the fragment is determined to not contain complete semantic information. If a fragment is determined to contain complete semantic information, the position of the partition boundary adjacent to the fragment is adjusted and the fragment partitioning and semantic integrity verification are re-executed until each fragment in the fragment set is verified to not contain complete semantic information.

4. The method for dynamically encrypting sensitive data in a trusted space according to claim 1, characterized in that, In S2, a first fragment identifier is generated for the first fragment, a second fragment identifier is generated for the second fragment, and so on, until an Nth fragment identifier is generated for the Nth fragment. Each fragment identifier is unique in the trusted data space, and a one-to-one mapping relationship between the fragment identifier and the corresponding fragment is established. For each fragment in the fragment set, obtain the fragment identifier corresponding to each fragment, and input the fragment identifier and the transformation seed value maintained in the trusted data space into the one-way mapping function to generate the transformation parameters corresponding to the fragment. The transformation behavior type is selected based on the bit sequence value of the first position interval in the transformation parameters, the number of execution rounds of the transformation behavior is determined based on the bit sequence value of the second position interval in the transformation parameters, and the execution order of each transformation behavior is determined based on the bit sequence value of the third position interval in the transformation parameters. The transformation behavior type includes at least two of the following: bit order rearrangement behavior, data substitution behavior, and XOR obfuscation behavior. According to the selected transformation behavior type, execution round and execution order, the fragment data content is transformed to obtain the initial transformed fragment, until the first initial transformed fragment corresponding to the first fragment, the second initial transformed fragment corresponding to the second fragment, and so on up to the Nth initial transformed fragment corresponding to the Nth fragment, forming an initial transformed fragment set; The fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment in the initial transformation fragment set are recorded in the fragment transformation information record.

5. The method for dynamically encrypting sensitive data in a trusted space according to claim 1, characterized in that, In step S3, the fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment in the initial transformation fragment set are obtained. A corresponding entry is constructed for each initial transformation fragment. The entry includes a fragment identifier field, a current transformation parameter field, and a current storage location field. The fragment identifier, transformation parameters, and storage location corresponding to each initial transformation fragment are written into the corresponding fields of the corresponding entry, until the first entry corresponding to the first initial transformation fragment, the second entry corresponding to the second initial transformation fragment, and so on up to the Nth entry corresponding to the Nth initial transformation fragment are obtained. The first, second, and Nth entries are combined to form a fragment transformation information record. The fragment transformation information record is written into the record storage area in the trusted data space. The record storage area and the storage node used to store the initial transformation fragment data are distinguished from each other on the physical medium or logical partition. A record identifier is assigned to the fragment transformation information record, and a mapping relationship is established between the record identifier and the data identifier of the original sensitive data.

6. The method for dynamically encrypting sensitive data in a trusted space according to claim 1, characterized in that, In step S4, a first storage node is selected from the list of available storage nodes in the trusted data space, the first initial transformation fragment is written into the first storage node, and the first storage location corresponding to the first storage node is recorded in the fragment transformation information record in the entry corresponding to the first initial transformation fragment. Select a second storage node from the list of available storage nodes. The second storage node is different from the first storage node in terms of physical location or logical partition. Write the second initial transformation fragment into the second storage node and record the second storage location corresponding to the second storage node in the fragment transformation information record in the entry corresponding to the second initial transformation fragment. Select the Nth storage node from the list of available storage nodes, write the Nth initial transformation fragment into the Nth storage node, and record the Nth storage location corresponding to the Nth storage node in the fragment transformation information record within the entry corresponding to the Nth initial transformation fragment.

7. The method for dynamically encrypting sensitive data in a trusted space according to claim 1, characterized in that, In step S5, the currently valid fragment transformation information record is obtained, and the fragment identifier and current transformation parameters corresponding to each fragment are extracted from the currently valid fragment transformation information record. The fragment transformation information record includes the first entry corresponding to the first initial transformation fragment, the second entry corresponding to the second initial transformation fragment, up to the Nth entry corresponding to the Nth initial transformation fragment. Each entry records the fragment identifier, transformation parameters and storage location of the corresponding fragment. For each fragment, the fragment identifier, the transformation seed value maintained in the trusted data space, and the update round identifier representing the order of this update operation are input into the one-way mapping function to generate the update transformation parameters. The updated transformation parameters differ numerically from the current transformation parameters.

8. The method for dynamically encrypting sensitive data in a trusted space according to claim 7, characterized in that, The update transformation behavior type is selected based on the bit sequence value of the first position interval in the update transformation parameters, the execution round of the update transformation behavior is determined based on the bit sequence value of the second position interval in the update transformation parameters, and the execution order of each update transformation behavior is determined based on the bit sequence value of the third position interval in the update transformation parameters. The update transformation behavior type includes at least two of the following: bit order rearrangement behavior, data substitution behavior, and XOR obfuscation behavior. According to the selected update transformation behavior type, execution round and execution order, the current data content of the corresponding fragment is transformed to obtain the update transformation fragment, until the first update transformation fragment corresponding to the first initial transformation fragment, the second update transformation fragment corresponding to the second initial transformation fragment, and so on until the Nth update transformation fragment corresponding to the Nth initial transformation fragment is obtained.

9. A method for dynamically encrypting sensitive data in a trusted space according to claim 7, characterized in that, Get all updated transformation fragments, modify the transformation parameter field in each entry of the fragment transformation information record from the current transformation parameter to the corresponding updated transformation parameter, generate the updated fragment transformation information record, and mark the fragment transformation information record before the update as history. Obtain a data access request, which includes the requester's identity and access authorization credentials. After verifying the validity of the access authorization credentials, obtain the updated fragment transformation information record. Based on the storage location of each entry in the updated fragment transformation information record, obtain the first updated transformation fragment, the second updated transformation fragment, and so on up to the Nth updated transformation fragment from the corresponding storage node.

10. A method for dynamically encrypting sensitive data in a trusted space according to claim 1, characterized in that, In step S6, a data access request is obtained, which includes the requester's identity identifier and access authorization credentials. After verifying the validity of the access authorization credentials, the currently valid fragment transformation information record is obtained. Based on the storage location of each entry record in the currently valid fragment transformation information record, all updated transformation fragments are obtained from the corresponding storage node. Based on the transformation parameters of each entry in the currently valid fragment transformation information record, the inverse transformation operation is performed on each updated transformation fragment to obtain the restored fragment set. The restored fragment set is then subjected to semantic recombination operation in reverse order of semantic decomposition operation to obtain the restored original sensitive data.

Images