Sensitive data protection system and method based on pseudonymous encryption

Abstract

The invention provides a sensitive data protection system and method based on pseudonymous encryption, and relates to the field of sensitive data protection, and the system comprises the following modules: a dynamic pseudonym generation module which is used for receiving original sensitive data in real time, and generating a dynamic pseudonym based on a quantum random number seed and a timeliness noise factor; and the regulation self-adaptive decision module is connected with the dynamic pseudonym generation module. According to the method, a quantum random number seed # imgabs0 #, a timeliness noise factor # imgabs1 # and a life cycle lt are adopted; the dynamic pseudonym is unpredictable and is short-term effective, the replay attack risk is remarkably reduced, key synthesis and data reduction are realized through an SGX secure enclave in a GDPR mode, the execution success rate of the forgotten right is ensured, and differential privacy k = 3, delta = 0.1 and Bloom Filter are adopted for desensitization in a CCPA mode, so that the reidentification risk is reduced.

Description

Technical Field

[0001] The present invention relates to the field of sensitive data protection, and in particular to a sensitive data protection system and method based on pseudonymous encryption. Background Art

[0002] Dynamic data desensitization lag Traditional pseudonymization systems use static mapping tables and cannot respond to data updates in real time (such as changes in user addresses that require full re-encryption), resulting in redundant data processing in the business system and pseudonym reversibility paradox. The "reasonable reversibility" required by GDPR conflicts with the "irreversibility requirement" of CCPA, and the existing system cannot dynamically adapt to different regulatory scenarios.

[0003] Therefore, we make improvements to this and propose a sensitive data protection system based on pseudonymous encryption. Summary of the invention

[0004] The purpose of the present invention is to address the problems raised by the current background technology.

[0005] In order to achieve the above-mentioned purpose of the invention, the present invention provides a sensitive data protection system and method based on pseudonymized encryption to improve the above-mentioned problem.

[0006] The specific application is as follows: Includes the following modules: Dynamic pseudonym generation module: used to receive original sensitive data in real time and generate dynamic pseudonyms based on quantum random number seeds and time-sensitive noise factors; Regulatory Adaptive Decision Module: Connects to the dynamic pseudonym generation module and selects reversible or irreversible encryption channels based on the data sovereignty tag (DS-Tag); Cross-domain semantic gateway: align pseudonym mapping relationships of heterogeneous systems through knowledge graphs; Quantum Security Enhancement Module: uses a post-quantum encryption algorithm based on lattice cryptography to protect keys; Context-aware access controller: Dynamically adjust data access permissions based on multi-dimensional environmental characteristics.

[0007] As the preferred technical solution of this application, the dynamic pseudonym generation module includes: Incremental update unit: uses the Delta Encoding algorithm to identify data change segments and encrypts only the incremental part; Hierarchical encryption unit: Perform the following operations to generate pseudonyms: ; in, The seed generated by the quantum random number generator, It is a time-sensitive noise factor with a life cycle of <50ms. SHA3 is a third-generation secure hash algorithm that outputs a 256-bit fixed-length hash value and maps data of any length into an irreversible unique fingerprint. Original data plain text The hash value of , LWE Encrypt is an encryption algorithm based on the learning with errors (Learning With Errors (LWE) problem), and ⊕ is XOR.

[0008] As the preferred technical solution of this application, the regulatory adaptive decision-making module includes: Policy decision tree: Input parameters include jurisdiction, data type, and usage scenario; Dual-channel routing unit: Reversible channel: using format-preserving encryption and key escrow services; Irreversible channel: Irreversible desensitization is achieved based on BloomFilter and k-anonymity algorithm.

[0009] As the preferred technical solution of this application, the data sovereignty tag contains the following metadata: Regulatory code of the data source; Transmission path encryption strategy sequence; Compliance check hash value.

[0010] As the preferred technical solution of this application, the quantum security enhancement module realizes: Quantum-resistant pseudonymization algorithm: ,in, is a distributed master key based on threshold secret sharing scheme sharding, MLWE Encrypt is a public key encryption algorithm based on modular LWE; Lattice sign is a digital signature algorithm based on lattice cryptography, is a lattice trapdoor, ⊕ is an exclusive OR; Key storage node: including hardware security module, blockchain smart contract and trusted execution environment.

[0011] As the preferred technical solution of this application, the cross-domain semantic gateway realizes mapping alignment through the following steps: S100, build industry knowledge graph and extract entity relationship triples; S200, using TransE algorithm to calculate cross-domain pseudonym similarity: ; in, is the source domain pseudonym vector, is the target domain pseudonym vector, is the domain relationship vector; S300. When the similarity is greater than 0.92, a federated mapping channel is established, otherwise the manual review process is triggered.

[0012] As the preferred technical solution of this application, the dynamic adjustment of access control permissions includes: Environmental feature collection: real-time acquisition of device fingerprints, geographic location, and operating behavior; Risk scoring model: Risk = 0.4 × log (amount of sensitive data) + 0.3 × device anomaly index + 0.3 × behavior deviation; Dynamic permission downgrade: When Risk>0.7, access blocking from pseudonym to plaintext is triggered.

[0013] A sensitive data protection method based on pseudonymized encryption includes the following steps: Data reception and classification: input raw data and label it with DS-Tag; Dynamic pseudonym generation: Generate hierarchical encrypted pseudonyms through a streaming computing engine; Regulatory policy matching: select reversible or irreversible encryption channel based on DS-Tag; Cross-domain semantic alignment: Establishing federated mapping relationships in the knowledge graph; Quantum key distribution: distribute key fragments to 8 nodes through threshold signature protocol; Access permission verification: Dynamically authorize decryption operations based on contextual risk scores.

[0014] As a preferred technical solution of this application, the reversibility control includes: GDPR Mode: Store the original data hash value H(D_plain) to the blockchain; Key synthesis and data recovery are performed through the SGX secure enclave; CCPA Model: Use the differential privacy algorithm (k=3, δ=0.1) to add noise; Regularly clear the logs that associate the original data with the pseudonyms.

[0015] Compared with the prior art, the present invention has the following beneficial effects: In the scheme of this application: 1. Through quantum random number seeds and temporal noise factor , life cycle <50ms, making dynamic pseudonyms unpredictable and short-term effective, significantly reducing the risk of replay attacks. In GDPR mode, key synthesis and data restoration are achieved through the SGX secure enclave to ensure the success rate of the "right to be forgotten". In CCPA mode, differential privacy (k=3,δ=0.1) and Bloom Filter desensitization are used to reduce the risk of re-identification. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 A schematic diagram of a sensitive data protection system based on pseudonymized encryption provided for this application. DETAILED DESCRIPTION

[0017] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0018] As described in the background technology, the traditional pseudonymization system with dynamic data desensitization lag uses a static mapping table and cannot respond to data updates in real time (such as changes in user addresses require full re-encryption), resulting in redundant data processing in the business system. The pseudonym reversibility paradox conflicts between the "reasonable reversibility" required by GDPR and the "irreversible requirement" of CCPA, and the existing system cannot dynamically adapt to different regulatory scenarios.

[0019] In order to solve this technical problem, the present invention provides a sensitive data protection system based on pseudonymized encryption, which is applied to the field of sensitive data protection.

[0020] In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings.

[0021] It should be noted that, in the absence of conflict, the embodiments of the present invention and the features and technical solutions in the embodiments may be combined with each other.

[0022] It should be noted that similar reference numerals and letters denote similar items in the following drawings, and therefore, once an item is defined in one drawing, further definition and explanation thereof is not required in subsequent drawings.

[0023] Example 1, please refer to Figure 1 , a sensitive data protection system based on pseudonymized encryption, including the following modules: Dynamic pseudonym generation module: used to receive original sensitive data in real time and generate dynamic pseudonyms based on quantum random number seeds and time-sensitive noise factors; Regulatory Adaptive Decision Module: Connects to the dynamic pseudonym generation module and selects reversible or irreversible encryption channels based on the data sovereignty tag (DS-Tag); Cross-domain semantic gateway: align pseudonym mapping relationships of heterogeneous systems through knowledge graphs; Quantum Security Enhancement Module: uses a post-quantum encryption algorithm based on lattice cryptography to protect keys; Context-aware access controller: Dynamically adjust data access permissions based on multi-dimensional environmental characteristics.

[0024] Embodiment 2 further optimizes the sensitive data protection system based on pseudonymized encryption provided in Embodiment 1. Specifically, the dynamic pseudonym generation module includes: Incremental update unit: uses the Delta Encoding algorithm to identify data change fragments and encrypts only the incremental part; Hierarchical encryption unit: Perform the following operations to generate pseudonyms: ; in, The seed generated by the quantum random number generator, is the time-effective noise factor with a life cycle <50ms ( It is a third-generation secure hash algorithm that outputs a 256-bit fixed-length hash value and maps data of any length into an irreversible unique fingerprint. Original data plain text The hash value of LWE Encrypt is an encryption algorithm based on the Learning With Errors (LWE) problem), ⊕ is XOR, which increases reflexivity and irreversibility.

[0025] The regulatory adaptive decision-making module includes: Policy decision tree: Input parameters include jurisdiction (GDPR / CCPA / PIPL), data type (PII / PHI), and usage scenario; Dual-channel routing unit: Reversible channel: using format-preserving encryption (FPE) and key escrow services; Irreversible channel: Irreversible desensitization is achieved based on BloomFilter and k-anonymity algorithm.

[0026] The data sovereignty tag (DS-Tag) contains the following metadata: The regulatory code of the data’s origin (e.g. GDPR Art.4(1)); Transmission path encryption strategy sequence (e.g. `FPE→BloomFilter`); Compliance verification hash value (generated based on the Merkle tree).

[0027] Quantum Security Enhancement Module implements: Quantum-resistant pseudonymization algorithm: ,in, It is a distributed master key based on Shamir threshold scheme (5-of-8) sharding, resistant to quantum computer attacks, and meets NIST post-quantum cryptography standards. It is a public key encryption algorithm based on Module-LWE. The parameters are polynomial ring dimension n=1024, modulus q=4294967291 (a prime number close to 2^32). The encryption process is: ,in and is the public key matrix, and is a random small polynomial, As the master key, the key K=0x5a3d...c7e is split into 8 fragments f(1), f(2),..., f(8) through Shamir threshold scheme (5-of-8). It is a digital signature algorithm based on lattice cryptography. Lattice Trapdoor, ⊕ is XOR, which logically combines public key encryption and lattice cryptographic signature to ensure confidentiality, authentication, and resistance to quantum attacks. Key storage nodes: including hardware security modules (HSM), blockchain smart contracts and trusted execution environments (TEE).

[0028] The cross-domain semantic gateway achieves mapping alignment through the following steps: S100, construct industry knowledge graph and extract entity relationship triples (such as <patient ID_123, owns, insurance number XK7-9B>); S200, using the improved TransE algorithm to calculate cross-domain pseudonym similarity: ; in, is the source domain pseudonym vector, is the target domain pseudonym vector, is the domain relationship vector; S300. When the similarity is greater than 0.92, a federated mapping channel is established, otherwise the manual review process is triggered.

[0029] Dynamic adjustment of access control permissions includes: Environmental feature collection: real-time acquisition of device fingerprint (MD5 value), geographic location (GPS / base station), and operation behavior (click frequency / data volume); Risk scoring model: Risk = 0.4 × log (amount of sensitive data) + 0.3 × device anomaly index + 0.3 × behavior deviation; Dynamic permission downgrade: When Risk>0.7, access blocking from pseudonym to plaintext is triggered.

[0030] In the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", "connected", "fixed" and the like should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral one; it can be a mechanical connection, an electrical connection, or communication with each other; it can be a direct connection, or an indirect connection through an intermediate medium, it can be the internal connection of two elements or the interaction relationship between two elements, unless otherwise clearly defined. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0031] Obviously, the embodiments described above are only some embodiments of the present invention, rather than all embodiments. The preferred embodiments of the present invention are given in the accompanying drawings, but they do not limit the patent scope of the present invention. The present invention can be implemented in many different forms. On the contrary, the purpose of providing these embodiments is to make the understanding of the disclosure of the present invention more thorough and comprehensive. Although the present invention has been described in detail with reference to the aforementioned embodiments, for those skilled in the art, it is still possible to modify the technical solutions recorded in the aforementioned specific embodiments, or to perform equivalent replacements for some of the technical features therein. Any equivalent structure made using the contents of the specification and drawings of the present invention, directly or indirectly used in other related technical fields, is also within the scope of patent protection of the present invention.

Claims

1. A sensitive data protection system based on pseudonymized encryption, characterized in that: Includes the following modules: Dynamic pseudonym generation module: used to receive original sensitive data in real time and generate dynamic pseudonyms based on quantum random number seeds and time-sensitive noise factors; Regulatory Adaptive Decision Module: Connects to the dynamic pseudonym generation module and selects reversible or irreversible encryption channels based on data sovereignty labels; Cross-domain semantic gateway: align pseudonym mapping relationships of heterogeneous systems through knowledge graphs; Quantum Security Enhancement Module: uses a post-quantum encryption algorithm based on lattice cryptography to protect keys; Context-aware access controller: Dynamically adjust data access permissions based on multi-dimensional environmental characteristics.

2. A sensitive data protection system based on pseudonymized encryption according to claim 1, characterized in that: The dynamic pseudonym generation module includes: Incremental update unit: identifies data change segments through incremental encoding algorithms and encrypts only the incremental parts; Hierarchical encryption unit: Perform the following operations to generate pseudonyms: ; in, The seed generated by the quantum random number generator, It is a time-sensitive noise factor with a life cycle of <50ms. SHA3 is a third-generation secure hash algorithm that outputs a 256-bit fixed-length hash value and maps data of any length into an irreversible unique fingerprint. Original data plain text The hash value of , LWE Encrypt is an encryption algorithm based on the fault-tolerant learning problem, and ⊕ is XOR.

3. A sensitive data protection system based on pseudonymized encryption according to claim 1, characterized in that: The regulatory adaptive decision-making module includes: Policy decision tree: Input parameters include jurisdiction, data type, and usage scenario; Dual-channel routing unit: Reversible channel: using format-preserving encryption and key escrow services; Irreversible channel: Irreversible desensitization is achieved based on Bloom filter and k-anonymity algorithm.

4. A sensitive data protection system based on pseudonymized encryption according to claim 1, characterized in that: The data sovereignty label contains the following metadata: Regulatory code of the data source; Transmission path encryption strategy sequence; Compliance check hash value.

5. A sensitive data protection system based on pseudonymized encryption according to claim 1, characterized in that: Quantum Security Enhancement Module implements: Quantum-resistant pseudonymization algorithm: ,in, is a distributed master key based on threshold secret sharing scheme sharding, MLWE Encrypt is a public key encryption algorithm based on modular LWE; Lattice sign is a digital signature algorithm based on lattice cryptography, is a lattice trapdoor, ⊕ is an exclusive OR; Key storage node: including hardware security module, blockchain smart contract and trusted execution environment.

6. A sensitive data protection system based on pseudonymized encryption according to claim 1, characterized in that: The cross-domain semantic gateway achieves mapping alignment through the following steps: S100, build industry knowledge graph and extract entity relationship triples; S200, using TransE algorithm to calculate cross-domain pseudonym similarity: ; in, is the source domain pseudonym vector, is the target domain pseudonym vector, is the domain relationship vector; S300. When the similarity is greater than 0.92, a federated mapping channel is established, otherwise the manual review process is triggered.

7. A sensitive data protection system based on pseudonymized encryption according to claim 1, characterized in that: Dynamic adjustment of access control permissions include: Environmental feature collection: real-time acquisition of device fingerprints, geographic location, and operating behavior; Risk scoring model: Risk = 0.4 × log (amount of sensitive data) + 0.3 × device anomaly index + 0.3 × behavior deviation; Dynamic permission downgrade: When Risk>0.7, access blocking from pseudonym to plaintext is triggered.

8. A method for protecting sensitive data based on pseudonymized encryption, using the sensitive data protection system based on pseudonymized encryption as claimed in claim 1, characterized in that: The following steps are involved: Data reception and classification: input raw data and label data sovereignty tags; Dynamic pseudonym generation: Generate hierarchical encrypted pseudonyms through a streaming computing engine; Regulatory policy matching: select reversible or irreversible encryption channels based on data sovereignty labels; Cross-domain semantic alignment: Establishing federated mapping relationships in the knowledge graph; Quantum key distribution: distribute key fragments to 8 nodes through threshold signature protocol; Access permission verification: Dynamically authorize decryption operations based on contextual risk scores.

9. A sensitive data protection method based on pseudonymized encryption according to claim 8, characterized in that: Reversibility controls include: GDPR Mode: Store the original data hash value H(D_plain) to the blockchain; Key synthesis and data recovery are performed through the SGX secure enclave; CCPA Model: Use the differential privacy algorithm with k=3 and δ=0.1 to add noise; Regularly clear the logs that associate the original data with the pseudonyms.

Images