Verifiable Information Deletion via Random Overwriting and Pseudo-Random Functions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for deleting information, especially in the context of big data, face challenges in ensuring deterministic deletion and verifying the completeness of information erasure, particularly due to high communication and computing overheads, and lack effective verification for multi-copy information.
Innovation Solution
A method and system utilizing fine-grained random overwriting and verifiable pseudo-random functions based on elliptic curves for information deletion and verification, allowing remote verification and ensuring non-recoverable deletion of information across multiple copies.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If blockchain network is used for verification, then verification security is improved, but communication overhead and computing costs increase
Solution Approach 1:
The patent extracts the verification function from the blockchain network and implements it locally on the server using a verifiable pseudo-random function. This allows the server to independently verify deletion without relying on the blockchain network, thereby maintaining verification security while eliminating the high computing costs and communication overhead associated with blockchain operations.
Solution Approach 2:
The patent introduces a verifiable pseudo-random function as an intermediary mechanism between the server and the verifying terminal. This function generates proof parameters that enable the verifying terminal to verify deletion without requiring direct interaction with the blockchain network, thus reducing communication overhead while maintaining verification integrity.
2Reliability
If fine-grained random overwriting is performed, then deletion completeness is improved, but processing time increases
Solution Approach 1:
The patent segments the deletion process into two main phases: overwriting phase and verification phase. During the overwriting phase, the server performs fine-grained random overwriting on the target data. In the verification phase, the server generates proof parameters that allow the verifying terminal to verify deletion completeness without requiring the server to re-process the entire dataset, thus reducing overall processing time while maintaining deletion completeness.
Solution Approach 2:
The patent implements preliminary action by generating proof parameters during or immediately after the overwriting process. These proof parameters capture essential verification information in advance, allowing the verifying terminal to perform rapid verification without requiring time-consuming re-processing of the deleted data, thereby reducing total processing time while ensuring deletion completeness.
3Reliability
If multiple copies of information are deleted, then deletion thoroughness is improved, but verification complexity increases
Solution Approach 1:
The patent merges the verification of multiple data copies into a unified verification process. The server generates a single set of proof parameters that encompasses all deleted data copies. The verifying terminal uses these consolidated proof parameters to verify deletion across all copies simultaneously, thereby maintaining deletion thoroughness while significantly reducing verification complexity compared to handling each copy separately.
4Measurement precision
If verifiable proof of deletion is generated for multiple domains, then verification accuracy is improved, but storage overhead and communication overhead increase
Solution Approach 1:
The patent changes the parameter representation of verification data by using cryptographic proof parameters instead of storing actual deleted data or detailed verification logs. These proof parameters are compact mathematical representations that enable accurate verification across multiple domains while occupying minimal storage space and requiring minimal communication bandwidth, thus maintaining verification accuracy while reducing storage and communication overhead.
Data Source
AI summary
A method and system for overwriting-based deletion of information and verification of deletion is provided, wherein the method at least includes: receiving a deletion request and/or a random seed; performing fine-grained overwriting on the information by means of random overwriting; in response to an extraction request for a post-deletion state, making a master node in a source domain of the information broadcast the extraction request to at least one slave node; and sending the post-deletion state fed back by the slave node and a related state-verification parameter to a verifying terminal, so that the verifying terminal verifies an overwriting result based on a verifiable pseudo-random function. Thus, the present application can effectively prevent information recovery after being logically deleted, and efficaciously ensure verifiability as well as non-recoverability of deleted information, thereby assuring non-recoverable deletion and providing verifiability of deletion to information subjects.