Achieve efficient position-heap-based privacy-preserving substring-of-keyword query over cloud

The cloud computing technique, which was initially used to mitigate the explosive growth of data, has been required to take both data privacy and users' query functionality into consideration. Symmetric searchable encryption (SSE) is a popular solution to supporting efficient keyword queries over encrypted data in the cloud. However, most of the existing SSE schemes focus on the exact keyword query and cannot work well when the user only remembers the substring of a keyword, i.e., substring-of-keyword query. This paper aims to investigate this issue by proposing an efficient and privacy-preserving substring-ofkeyword query scheme over cloud. First, we employ the position heap technique to design a novel tree-based index to match substrings with corresponding keywords. Then based on the tree-based index, we introduce our substring-of-keyword query scheme, which contains two consecutive phases. The first phase queries the keywords that match a given substring, and the second phase queries the files that match a keyword in which people are really interested. In addition, detailed security analysis and experimental results demonstrate the security and efficiency of our proposed scheme. (c) 2021 Elsevier Ltd. All rights reserved.

Automated summary

This paper investigates the privacy and efficiency issues of keyword substring queries in cloud computing, proposing a tree-based index and keyword substring query scheme with two consecutive phases. Detailed security analysis and experimental results validate the security and efficiency of the proposed scheme.