Compressed Encrypted Inverted Index for Secure Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing searchable encryption systems face challenges in securely outsourcing encrypted data while allowing efficient search operations without compromising privacy, as they often require revealing search queries to third-party servers, which can compromise data security.
Innovation Solution
A searchable symmetric encryption (SSE) system and method that processes an inverted index using a client-server architecture, where the client generates a search index and token, and the server performs search operations, incorporating a compress then X scheme with linked list or array functions to compress and decompress entries, ensuring privacy by not revealing search keywords to the server.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If searchable encryption systems allow efficient search operations on encrypted data, then search productivity is improved, but data security deteriorates because search queries must be revealed to third-party servers
Solution Approach 1:
The system segments the encrypted index into multiple blocks and stores them separately in the encrypted inverted index structure. Each block can be independently processed and searched, allowing the server to perform efficient search operations on specific blocks without needing to access or learn about the entire index or the search queries themselves.
Solution Approach 2:
The patent introduces an intermediary encrypted inverted index structure that acts as a mediator between the client's encrypted data and the server's search operations. This structure contains encrypted term documents and posting lists that enable the server to perform searches without directly accessing or understanding the original encrypted data or search queries, thus maintaining security while enabling efficiency.
2Loss of information
If the encrypted index stores detailed document information, then search completeness is improved, but storage overhead increases
Solution Approach 1:
The system implements a nested structure where encrypted term documents are contained within the encrypted inverted index, which in turn contains posting lists that reference document identifiers. This nested organization allows the system to store detailed information in a compact, hierarchical manner, reducing overall storage overhead while maintaining search completeness.
Solution Approach 2:
The patent organizes the encrypted index into multiple dimensions including term documents dimension, posting lists dimension, and document identifiers dimension. By distributing information across these dimensions rather than storing everything in a single structure, the system reduces storage overhead while ensuring that all necessary information is available for complete search operations.
Data Source
AI summary
A searchable symmetric encryption (SSE) system and method of processing inverted index is provided. The SSE system includes genKey, buildSecureIndex, genToken, and search operations. A compress X is integrated into at least one of the buildSecureIndex and search operations. The compress then X takes each entry of an encrypted index, compresses entry of the encrypted index into a compressed entry, and then processes the compressed entry with a function. The function comprises a linked list function and on array function. The search operation decompresses the processed entry and output the decompressed entry. The SSE comprises a client device and a server. The genKey, buildSecureIndex, and genToken operations are integrated into the client device and the search operation is integrated into the server.