Multi-Copy Personal Data Deletion With Hash-Based Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for deleting multi-copy personal data are inefficient and insecure, leading to incomplete deletion and potential privacy breaches due to communication failures or unauthorized data recovery, with existing systems being complex and costly.
Innovation Solution
A method and system that involves signing and uploading personal data with a unique identifier, circulating copies among data domains, and ensuring complete deletion by recording source and destination, enabling verification and logging of deletion processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If cryptographic technologies are used to ensure ciphertext unreadability and unrecoverability, then data security is improved, but the system complexity increases and complete deletion verification becomes questionable
Solution Approach 1:
The patent extracts the core deletion verification mechanism from complex cryptographic systems by using simple hash functions instead of elaborate encryption schemes. The hash function H(m||i) creates a lightweight, computationally efficient way to verify deletion without requiring complex key management or cryptographic protocols, thus reducing system complexity while maintaining security.
Solution Approach 2:
The patent uses disposable hash values that are easily computed and verified. Each data domain generates a hash value for its copy of the personal data, and these hash values are temporary artifacts used only for verification purposes. This approach avoids the need for long-term cryptographic key management and complex security infrastructure.
2Reliability
If association-based deletion is implemented to delete all copies when original file is deleted, then deletion completeness is improved, but the difficulty of detecting and measuring all copies increases
Solution Approach 1:
The patent implements a feedback mechanism where each data domain sends its hash value to the first data domain, which collects all hash values and compares them against the list of personal data to be deleted. This feedback loop ensures that all copies are detected and deleted, improving deletion completeness while maintaining a simple detection mechanism through the use of hash values rather than complex copy tracking.
Solution Approach 2:
The hash function serves multiple purposes: it verifies data integrity, identifies copies for deletion, and provides a unique identifier for each copy. This multi-functionality simplifies the detection process by using a single mechanism (hash comparison) to achieve multiple objectives, reducing the complexity of detecting and measuring all copies.
3Productivity
If communication protocols are simplified to improve efficiency, then deletion speed is improved, but the reliability of complete deletion notification decreases
Solution Approach 1:
The patent performs preliminary actions by having each data domain pre-compute and send its hash value to the first data domain before the actual deletion process begins. This preliminary exchange of hash values establishes a complete inventory of all copies, ensuring that even if communication fails during deletion execution, the system has already captured all necessary information to ensure complete deletion.
Solution Approach 2:
The patent replaces complex mechanical communication protocols with a simple hash-based verification system. Instead of relying on multiple rounds of communication and acknowledgment messages, the system uses cryptographic hash functions to create unambiguous, verifiable deletion proofs. This substitution maintains high deletion speed while improving notification reliability through the mathematical properties of hash functions.
Data Source
AI summary
A method and system for deleting multi-copy personal data efficiently and securely is provided, wherein the personal data and its subject identifier are signed and uploaded to data domains and stored as personal data copies; the personal data copies along with its source and destination data are circulated among the data domains; the data domain receiving a deletion instruction transmits the deletion instruction to every relevant data domains based on the identifier of the personal data subject and the destination data and then performs deletion; and after completing the deletion, the data domain deposit its domain identifier and feedback data it receives into a log, and feed the log back to its superior data domain. And the system of the present disclosure includes a plurality of data domains that can perform the above operations, thereby realizing association-based storage, association-based deletion and verification of association-based deletion of multi-copy personal data.