Encrypted Data Search Result Count Masking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing search methods in encrypted data tables are vulnerable to malicious interception, as they transmit unencrypted search results, allowing attackers to determine the number of search results, compromising data security.
Innovation Solution
A method that masks the search keyword and uses a client device to generate a hidden search request, employing indexing servers and a chaining data table to protect the number of search results, ensuring encrypted data transmission and secure result retrieval without revealing the count of matching records.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If the server transmits search results in unencrypted form for client usage, then the client can use the search results, but the transmitted data becomes vulnerable to interception and the attacker can determine the number of search results
Solution Approach 1:
The patent introduces an intermediary encryption mechanism where the server encrypts search results before transmission and the client decrypts them after reception. This intermediary encryption layer protects the search results during transmission while still allowing the client to use them, resolving the contradiction between usability and security.
Solution Approach 2:
The patent applies preliminary anti-action by pre-encrypting the search results before they are transmitted to the client. This preventive measure counteracts the potential harm of interception in advance, ensuring that even if the transmission is intercepted, the attacker cannot obtain useful information about the number or content of search results.
2Object-affected harmful factors
If the data in the data table is encrypted to prevent unauthorized access, then the data security is improved, but the search operation becomes more complex and requires special handling
Solution Approach 1:
The patent applies preliminary action by pre-processing the encryption of data during table creation or data insertion, rather than encrypting during search operations. The search system is designed to work with the pre-encrypted structure, using encrypted prefixes for matching. This reduces the complexity of search operations while maintaining data security.
Solution Approach 2:
The patent replaces traditional mechanical text matching with cryptographic operations. Instead of comparing plain text prefixes, the system compares encrypted prefixes using cryptographic functions. This substitution maintains security while enabling efficient search operations on encrypted data.
3Object-affected harmful factors
If the search results are transmitted with encryption to protect data, then the data transmission security is improved, but the client cannot directly use the encrypted results
Solution Approach 1:
The patent introduces encryption and decryption as intermediary steps in the search result transmission process. The server encrypts results before transmission, and the client decrypts them after reception. This intermediary cryptographic process protects data during transmission while ensuring the client receives usable plain text results.
Solution Approach 2:
The patent applies the discarding and recovering principle by temporarily encrypting search results during transmission and then recovering (decrypting) them at the client side for use. The encryption is discarded after serving its protective function during transmission, allowing the client to access and use the plain text results.
Data Source
Figure 1
Figure 2~3
Figure 4
AI summary
The invention relates to a method for securely searching for one or more addresses of structured data containing a keyword, implemented respectively in a client device and in a system comprising at least one first indexing server containing an indexing table (TAB-INDEX) and at least one second indexing server containing a chaining data table (TAB-CHAIN). The invention provides protection for the search results, and in particular for the number of structured data items comprising the search results.