Encrypted Data Management via Synchronized Search and Order Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database systems fail to provide adequate protection for encrypted data, as they often decrypt data for sorting and searching, exposing it to theft and liability, and existing order-preserving cryptographic algorithms are not strong enough for high-security applications.
Innovation Solution
The use of synchronized search and order data structures that keep data encrypted, with the search data structure organized by encrypted keys and the order data structure by unencrypted keys, minimizing exposure of unencrypted data and reducing computational overhead through a cryptographic plug-in architecture.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is encrypted in the database, then security is improved, but sorting and searching operations require decryption which increases computational overhead and exposes data
Solution Approach 1:
The patent divides the database system into two distinct components: an encrypted storage layer that maintains data security, and an unencrypted index layer that enables efficient sorting and searching. The index structures (B-trees, hash indexes) are maintained separately from the encrypted data, allowing queries to be processed on the index without decrypting the actual data records.
Solution Approach 2:
The patent introduces unencrypted index structures as intermediary elements between the query interface and the encrypted data storage. These indexes act as mediators that enable fast data retrieval through sorting and searching operations without requiring the underlying data to be decrypted, thus maintaining security while improving operational efficiency.
2Productivity
If data is decrypted for sorting and searching, then operational efficiency is improved, but data exposure to theft and liability increases
Solution Approach 1:
The patent segments the data handling process so that only index structures are unencrypted and exposed, while the actual data records remain encrypted in storage. This segmentation ensures that even if index structures are compromised, the core data remains protected, significantly reducing the harmful effects of potential data exposure.
Solution Approach 2:
The patent applies partial decryption by maintaining unencrypted index structures that contain only a subset of the data information (keys and pointers) rather than the complete data records. This partial action provides sufficient functionality for sorting and searching while minimizing the amount of exposed data, thereby reducing liability and security risks.
3Speed
If unencrypted data is stored on disk for fast access, then data retrieval speed is improved, but vulnerability to theft during system crashes or hibernation increases
Solution Approach 1:
The patent uses unencrypted index structures stored on disk as intermediary elements that provide fast data retrieval capability without storing the actual data in unencrypted form. The indexes enable rapid location of encrypted data records, maintaining speed while eliminating the vulnerability associated with storing unencrypted data on persistent storage media.
4Ease of operation
If order-preserving cryptographic algorithms are used, then sorting capability is improved, but cryptographic strength is reduced making it inadequate for high security applications
Solution Approach 1:
The patent separates the sorting function from the encryption function by maintaining unencrypted index structures that handle sorting operations, while the encrypted data records maintain their cryptographic strength. This segmentation allows the system to provide full sorting capability through the indexes without compromising the cryptographic security of the actual data.
Solution Approach 2:
The unencrypted index structures serve as intermediary elements that provide sorting capability without requiring order-preserving cryptographic algorithms. The indexes enable efficient sorting and range queries on encrypted data by operating on unencrypted key values, thus eliminating the need to weaken cryptographic strength for sorting purposes.
Data Source
AI summary
A method of using synchronized search and order data structures to access a collection of data comprising organizing the search data structure by encrypted key value, wherein the search data structure contains only references to elements in the collection and their associated encrypted keys, organizing the order data structure by unencrypted key value, wherein the order data structure contains only references to elements in the collection and their associated encrypted keys, exposing a maximum of two pieces of clear text data during operations on the collection, engaging in insert or delete operations, engaging in update operations; engaging in search operations, engaging in sort operations, engaging in merge operations, and reporting the results of those operations to the user.