Retrieval Transformation: Dynamic Searchable Symmetric Encryption With Strong Security

• Published in: IEEE systems journal Vol. 17; no. 4; pp. 1 - 12
• Main Authors: Qin, Guiyun, Liu, Pengtao, Hu, Chengyu, Li, Zengpeng, Guo, Shanqing
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.12.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Computation; Cryptography; Encryption; Homomorphic encryption; Indexes; Leakage; multisearchable computing; nonrestrictive index capacity management; pattern privacy guarantee; Privacy; Pseudorandom; Security; Servers; Switches
• ISSN: 1932-8184; 1937-9234
• DOI: 10.1109/JSYST.2023.3288052

Extending the single-user searchable symmetric encryption (SSE) immediately to the multiuser scenario is not straightforward. In the multiuser scenario, recipients cannot safely achieve multisearchable computing without using a third party or specified users, which diminishes the application's utility. Moreover, there are two issues related to pattern privacy and file updating: One is that the majority of extant SSEs only emphasize the privacy of a partial pattern (one of the search/access/size patterns), resulting in information leakage. The second issue is that, with the exponential expansion of the number of files, it is unclear how to achieve unrestricted index capacity management while efficiently updating the encrypted index. To overcome the aforementioned issues, we offer a general dynamic named <inline-formula><tex-math notation="LaTeX">G</tex-math></inline-formula>-<inline-formula><tex-math notation="LaTeX">DSSE</tex-math></inline-formula>, that is blended with the pseudorandom function and the integer vector homomorphic encryption. Combining <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula>-anonymity and delayed write-back techniques, <inline-formula><tex-math notation="LaTeX">G</tex-math></inline-formula>-<inline-formula><tex-math notation="LaTeX">DSSE</tex-math></inline-formula> can realize multisearchable computing without relying on a third party while simultaneously guaranteeing multiple patterns and greater forward/backward privacies. The combination of <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula>-anonymity and delayed write-back solves the unnecessary waste of communication overhead and the problem of pattern leakage in extreme cases. <inline-formula><tex-math notation="LaTeX">G</tex-math></inline-formula>-<inline-formula><tex-math notation="LaTeX">DSSE</tex-math></inline-formula> achieves noninteractive update, even batch update, and nonrestrictive index capacity management in the encrypted index. Meanwhile, it can be expanded flexibly to ensure the precision and integrity of search results.