Homomorphic Database Querying via Pre-Transformed Data Segments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database query systems face significant delays and performance issues when working with encrypted data, as they require decryption and re-encryption, which consumes vast processing resources and does not offer robust analytical capabilities over encrypted data.
Innovation Solution
A method and system that allows querying of anonymized databases without decrypting the data, using deterministic encryption and mathematical transformations to maintain query performance, while providing robust security against re-identification attacks by distributing data into groups and using fake records to obscure frequency analysis.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is encrypted and stored in the database, then security is improved, but query performance deteriorates due to decryption and re-encryption overhead
Solution Approach 1:
The patent applies preliminary action by pre-processing data during insertion to create multiple transformed versions (different encodings, aggregations, and representations) and storing them in advance. When queries arrive, the system can directly use these pre-transformed versions without real-time decryption or transformation, eliminating the performance penalty while maintaining security.
Solution Approach 2:
The patent segments data into multiple transformed versions stored in separate columns or tables. Each version serves specific query types (e.g., encrypted original data for security, aggregated data for analytics, different encodings for various query patterns). This segmentation allows the system to optimize query performance by selecting the appropriate pre-transformed version without decrypting all data.
2Speed
If data is decrypted for querying, then query speed is improved, but security deteriorates due to exposure of sensitive information
Solution Approach 1:
The system performs preliminary transformations of data into multiple formats (encrypted, aggregated, anonymized) during data insertion. When queries are executed, the system can directly retrieve and use these pre-transformed versions without decrypting sensitive information, achieving fast query performance while maintaining security through the use of pre-prepared secure representations.
3Reliability
If traditional encryption methods are used, then security is improved, but analytical capabilities deteriorate due to inability to perform operations on encrypted data
Solution Approach 1:
The patent segments data into multiple transformed versions, including encrypted originals, aggregated summaries, anonymized copies, and differently encoded representations. Each segment serves specific analytical needs: encrypted data for security-critical operations, aggregated data for analytics, and anonymized data for reporting. This enables robust analytical capabilities across encrypted data without compromising security.
Solution Approach 2:
The system applies parameter changes by transforming data into multiple representations with different properties (encryption levels, aggregation levels, anonymization degrees). This allows the system to adapt to various analytical requirements by selecting the appropriate transformed version, providing versatile analytical capabilities while maintaining security through parameterized transformations.
4Reliability
If existing methods perform operations on encrypted data directly, then security is maintained, but performance deteriorates significantly compared to unencrypted data
Solution Approach 1:
The patent applies preliminary action by pre-processing data during insertion to create multiple transformed versions (different encodings, aggregations, and representations) and storing them in advance. When queries arrive, the system can directly use these pre-transformed versions without real-time decryption or transformation, eliminating the performance penalty while maintaining security.
Data Source
AI summary
The present invention relates generally to a system and method of querying an anonymized database. More particularly, the invention provides a method and system for querying an anonymized database without the need to decrypt queried data while it's processed. Even more specifically, the invention provides a method and system of anonymizing a database such that it may be queried efficiently in near real time while still retaining the ability to not decrypt requested data while it's being processed.


