Encrypted E-book Search Indexing via Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Searching encrypted e-book content is inefficient as it requires decrypting the entire content before a search can be performed, which is time-consuming and resource-intensive.
Innovation Solution
Creating and storing index information that maps phrases to encrypted segments within logical partitions of an e-book, allowing for efficient searching without decrypting the entire content, using a computer-implemented method that identifies logical partitions, creates encrypted segments, and stores index information indicating the presence of phrases within these segments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the entire e-book content is decrypted before searching, then the search can be performed on the decrypted content, but the process becomes time-consuming and resource-intensive
Solution Approach 1:
The e-book content is divided into multiple encrypted segments, each with its own index data. Instead of decrypting the entire e-book, only the specific encrypted segments containing the search phrase are decrypted and searched. This segmentation allows the system to maintain search accuracy on decrypted portions while dramatically reducing the time and resources required by avoiding full-content decryption.
Solution Approach 2:
Index information is pre-computed and stored for each encrypted segment before searching occurs. The index data contains pre-processed information about the content within each segment, allowing the system to quickly identify which segments contain the search phrase without decrypting them first. This preliminary indexing action enables efficient location of relevant segments, reducing search time while maintaining accuracy.
2Measurement precision
If the entire e-book content is decrypted before searching, then complete search coverage is achieved, but computational resources are excessively consumed
Solution Approach 1:
The e-book is segmented into multiple encrypted portions, each with independent index data. The system decrypts and searches only the specific segments that contain the search phrase, rather than decrypting the entire e-book. This ensures complete search coverage within the relevant segments while minimizing computational resource usage by avoiding unnecessary decryption of unrelated content.
Solution Approach 2:
Instead of performing the excessive action of decrypting the entire e-book, the system performs partial decryption only of the specific segments containing the search phrase. The index information guides this partial action, ensuring that search coverage is sufficient for the query while computational resources are conserved by avoiding unnecessary processing of unrelated segments.
3Productivity
If index information is created for encrypted segments, then searching efficiency is improved, but the system complexity increases
Solution Approach 1:
The system creates index information for each encrypted segment separately, organizing the index data to correspond with the segmented structure. This segmentation approach improves search efficiency by enabling quick identification of relevant segments through their indexes, while managing system complexity by processing and storing index data in manageable, modular units rather than handling the entire e-book as a single complex structure.
Data Source
AI summary
An e-book server creates index information for encrypted e-book content. The index information is used by a reader module to efficiently search the encrypted content. To create the index information, the e-book server identifies logical partitions of an e-book that include phrases, and creates encrypted segments including a portion of the e-book content that is not necessarily aligned with the logical partitions of the e-book. The e-book server then stores index information including a mapping between the encrypted segments and the phrases located in the logical partitions.