Search Query Protection via Sub-Query Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Public search engines can inadvertently reveal private information when used to search for sensitive queries, as existing methods either produce less useful results or increase processing loads, and current solutions like encryption and confidential search systems face limitations in practical application.
Innovation Solution
A search apparatus that divides a search query into sub-queries and submits them to multiple search engines, using keyword combination and exclusion techniques to prevent private information from being surmised, while integrating relevant results efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If a public search engine is used to search for private information, then search results can be obtained, but private information may be surmised from keywords in the search query
Solution Approach 1:
The search query is divided into multiple sub-queries, each containing different keywords. These sub-queries are then submitted to different search engines simultaneously. This segmentation prevents any single search engine from inferring private information from a complete query, while still achieving comprehensive search results through aggregation of sub-query results.
2Loss of information
If encryption or confidential search systems are used to protect private information, then privacy can be maintained, but processing loads increase and practical application becomes difficult
Solution Approach 1:
A search apparatus acts as an intermediary between the user and multiple search engines. This apparatus generates sub-queries from the original query and distributes them to different search engines, which return results that are then aggregated and presented to the user. This intermediary approach protects privacy without requiring complex encryption systems or confidential search infrastructure.
3Loss of information
If search queries are divided into sub-queries and submitted to multiple search engines, then private information is protected, but processing time may increase
Solution Approach 1:
The search apparatus periodically generates sub-queries and submits them to different search engines in a systematic manner. By organizing the search process into periodic cycles of sub-query generation and submission, the system efficiently manages processing time while maintaining privacy protection through diversified query distribution.
Data Source
AI summary
A method of protecting information in search queries uses a search apparatus with a user interface that is configured for connection to a computer network that comprises a plurality of search engines on a plurality of servers. The method includes receiving a search query comprising a plurality of keywords; dividing the search query into a number of sub-queries, each sub-query comprising at least one of the keywords; and submitting the sub-queries to different search engines.


