Document Data Deletion via Selective Key Ring Rendering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Deduplication systems face inefficiencies in securely deleting data segments when the last copy is no longer needed, as existing methods are difficult to detect and manage, especially in large systems, and current solutions either drain bandwidth or increase management costs.
Innovation Solution
A method involving a computer system with multiple sets of decryption keys associated with documents and data segments, where the first set of keys is rendered unusable upon deletion of a document, while the second and third sets remain usable, ensuring secure inaccessibility of unique data segments without affecting common data segments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data segments are securely deleted by overwriting with random data pattern, then data security is improved, but bandwidth is drained and system efficiency deteriorates
Solution Approach 1:
The patent segments the key management process by creating separate key rings for different data segments. When a document is deleted, only the specific key ring associated with that document is rendered unusable, rather than overwriting all data segments. This selective approach maintains security while avoiding the bandwidth drainage and efficiency loss of system-wide overwriting operations.
Solution Approach 2:
The patent introduces decryption keys as an intermediary mechanism between documents and data segments. Instead of directly deleting or overwriting data segments, the system renders the intermediary keys unusable, which indirectly secures the data segments without requiring direct manipulation of the segment data itself. This intermediary approach enables secure deletion without the performance penalty of data overwriting.
2Difficulty of detecting and measuring
If individual common data segments are tagged with lifecycle information, then data deletion tracking is improved, but management costs increase greatly
Solution Approach 1:
The patent merges the lifecycle management information into the key ring structure itself. Instead of tagging individual data segments with separate lifecycle metadata, the key ring contains reference counts that automatically track how many documents reference each data segment. This consolidation eliminates the need for separate tagging systems while maintaining accurate deletion tracking.
Solution Approach 2:
The key ring structure performs self-service by automatically maintaining reference counts and determining when data segments can be securely deleted. The system does not require external management intervention to track lifecycle information - the key ring itself tracks its own usage and automatically knows when it's safe to render keys unusable, reducing management overhead.
3Reliability
If decryption keys are rendered unusable upon document deletion, then data security is improved, but key management complexity increases
Solution Approach 1:
The patent performs preliminary organization of keys into structured key rings before deletion operations are needed. Each key ring is pre-configured with reference counting mechanisms and associations with specific data segments. When deletion occurs, the pre-organized structure allows immediate rendering of keys unusable without complex real-time management decisions, reducing operational complexity while maintaining security.
Data Source
AI summary
A computer system having at least first and second documents, a plurality of decryption keys, and a plurality of data segments stored therein, is provided. Each of the plurality of data segments is decryptable by a selected one of the decryption keys. The decryption keys include a first set of decryption keys associated with the first document and not associated with the second document, a second set of decryption keys associated with the second document and not associated with the first document, and a third set of decryption keys associated with the first document and the second document. The first document is deleted, and in response, the first set of decryption keys is rendered unusable, and the second set of decryption keys and the third set of decryption keys are not rendered unusable.