Searchable Symmetric Encryption Dual Database Parallel Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing robust dynamic searchable symmetrical encryption methods suffer from costly algebraic operations during key updates and limited retrieval efficiency due to single-threading and repeated retrieval of ciphertexts, which degrades performance and prevents parallel processing.
Innovation Solution
Implementing a dual database structure with a ciphertext database for newly uploaded and unretrieved ciphertexts and a cache database for retrieved ciphertexts, allowing direct retrieval from the cache to skip redundant computations and enable multithreading, thereby improving retrieval efficiency and robustness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a hidden link table structure is used to store ciphertext and implement robust searchable symmetrical encryption, then robustness against false requests is improved, but retrieval efficiency deteriorates due to single-threading limitation
Solution Approach 1:
The patent divides the single link table structure into multiple parallel link tables (first link table, second link table, etc.), each storing a portion of the ciphertext. This segmentation enables multiple retrieval threads to operate simultaneously on different link tables, transforming the single-threaded robust retrieval into a multi-threaded parallel retrieval system that maintains robustness while improving efficiency.
2Reliability
If algebraic operations are performed during ciphertext deletion to ensure correctness, then robustness is improved, but execution efficiency deteriorates
Solution Approach 1:
The patent creates a copy of the ciphertext (deletion credential) that contains all necessary information for verifying and performing deletion operations. Instead of performing complex algebraic operations on the original ciphertext structure, the system uses this copied credential structure to efficiently verify deletion requests and update the link tables, significantly reducing execution time while maintaining robustness.
3Reliability
If repeated retrieval of ciphertexts is performed without caching, then retrieval correctness is ensured, but performance deteriorates due to redundant computations
Solution Approach 1:
The patent performs preliminary actions by pre-computing and storing deletion credentials and retrieval information in the link table structure before actual retrieval or deletion operations are needed. The deletion credential is generated and stored in advance with the ciphertext, containing all necessary information for future deletion verification. This preliminary preparation eliminates redundant computations during repeated retrieval operations while ensuring correctness through the pre-established verification mechanisms.
Data Source
AI summary
The present invention relates to a method and a system for robust, searchable, symmetrical encryption, the method comprising: during initialization, having a retrieval server perform retrieval on stored ciphertext information according to a searchable ciphertext and retrieval trapdoor information (Cntupd, K, Locgrp) sent by a client, wherein, the retrieval server acquires a last received first ciphertext set Cnew from a ciphertext database CDB just before the present retrieval according to a retrieval key K and an encryption counter Cntupd sent by the client, acquiring a second ciphertext set Ccache in a retrieval request history from a cache ciphertext database GRP according to a cache ciphertext index Locgrp, and merging the first ciphertext set Cnew and the second ciphertext set Ccache to form a retrieval set , and sending it to the client for decryption. The present invention is able to improve retrieval performance of searchable symmetrical encryption algorithm with robust forward and backward secrecy and to make searchable symmetrical encryption algorithm more practical.