Secure Database Substring Matching via Irreversible Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database systems face challenges in securely querying encrypted data, as substring matching is not feasible with ciphertext, and prior methods require decrypting all data for keyword searches, compromising security and efficiency.
Innovation Solution
The method involves partitioning raw data into substrings, irreversibly encrypting them using a hash algorithm, and reversibly encrypting the data, associating irreversibly encrypted substrings with reversibly encrypted data to enhance security and enable secure substring matching without decrypting all data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If all data is decrypted before keyword search, then substring matching can be performed, but database security is compromised
Solution Approach 1:
The patent divides the database into multiple partitions, each containing a subset of the encrypted data. This segmentation allows the system to perform searches on individual partitions without requiring decryption of the entire database, thus maintaining security while enabling search functionality.
Solution Approach 2:
The patent introduces encrypted index structures as intermediaries between the search query and the encrypted data. These indexes allow substring matching to be performed on encrypted data without full decryption, acting as a mediator that enables search capability while preserving security.
2Reliability
If encrypted storage is used, then database security is improved, but substring matching cannot be performed
Solution Approach 1:
The patent performs preliminary encryption of the data and creation of encrypted index structures before any search operations. This preliminary action enables subsequent substring matching on encrypted data without requiring decryption during the search process itself.
Solution Approach 2:
The patent changes the parameter of data representation from plain text to encrypted text, while simultaneously creating encrypted indexes that allow substring matching operations to be performed on the encrypted representation. This parameter change enables both security and search capability.
3Productivity
If an index dictionary is pre-established for ciphertext, then query efficiency is improved, but storage complexity increases
Solution Approach 1:
The patent segments the index dictionary into multiple partitions corresponding to different data partitions. This segmentation reduces the complexity of managing a single large index while maintaining query efficiency, as searches can be directed to specific partitions based on the query parameters.
Data Source
AI summary
A data processing method includes receiving a query word and in response to receiving the query word, searching a plurality of stored irreversibly encrypted substrings corresponding to the query word, where each of the plurality of stored irreversibly encrypted substrings is associated with a string of reversibly encrypted raw data. The data processing method further includes in response to searching, outputting one or more of the plurality of stored irreversibly encrypted substrings and the associated string of reversibly encrypted raw data corresponding to the query word as a query result.