Hierarchical Key Structure for Per-Record Data Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data encryption methods require decrypting and re-encrypting the entire data set for even small modifications, making them impractical for larger data sets due to resource-intensive computations.
Innovation Solution
A hierarchical key structure is implemented using a key derivation function, random salt generator, symmetric key generator, and symmetric cipher to encrypt and decrypt data only on a per-record basis, allowing for efficient encryption and decryption of shared data without needing to modify the entire data set.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional encryption methods are used to encrypt and decrypt data, then data security is maintained, but the entire data set must be decrypted and re-encrypted for even small modifications, making it impractical for larger data sets due to resource-intensive computations
Solution Approach 1:
The patent segments the data set into individual records, each encrypted with its own unique record key. This allows modification of individual records without requiring decryption and re-encryption of the entire data set. The master key encrypts multiple record keys, creating a hierarchical structure where only the specific record needing modification is processed, dramatically improving encryption efficiency while maintaining security.
2Stability of the object's composition
If the full data set is decrypted and re-encrypted for modifications, then data integrity is maintained, but computational resources and time are excessively consumed for larger data sets
Solution Approach 1:
By dividing the data into individually encrypted records with unique keys, the system enables modification of only the specific record that needs changing. This segmentation preserves data integrity for modified records while avoiding the time-consuming process of re-encrypting the entire data set, thus reducing encryption time significantly.
Solution Approach 2:
The patent performs preliminary encryption by encrypting each record with its own record key and then encrypting the record key with the master key before storing. This preliminary action ensures that when modifications are needed, only the specific record and its key need to be processed, rather than the entire data set, thereby maintaining integrity while reducing time loss.
3Productivity
If a hierarchical key structure is implemented, then computational resources are reduced for encryption and decryption, but the key management structure becomes more complex
Solution Approach 1:
The patent implements a nested hierarchical key structure where the master key encrypts multiple record keys, and each record key encrypts its corresponding record. This nesting approach improves encryption efficiency by allowing selective processing of individual records while managing key complexity through a clear hierarchical relationship, making key management more systematic rather than simpler.
Data Source
AI summary
A data set shared by multiple nodes is encrypted. The data set can be split into independent records. The records can be encrypted and shared independently, without the need to modify and transmit the full data set. Although the records are encrypted with their own encryption key, they are all accessible by a single authentication method.