Abstract
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. Searchable symmetric encryption (SSE) is a popular solution that can support efficient attribute queries over encrypted datasets in the cloud. In particular, some SSE schemes focus on the substring query, which deals with the situation that the user only remembers the substring of the queried attribute. However, all of them just consider substring queries on a single attribute, which cannot be used to achieve compound substring queries on multiple attributes. This paper aims to address this issue by proposing an efficient and privacy-preserving SSE scheme supporting compound substring queries. In specific, we first employ the position heap technique to design a novel tree-based index to support substring queries on a single attribute and employ pseudorandom function (PRF) and fully homomorphic encryption (FHE) techniques to protect its privacy. Then, based on the homomorphism of FHE, we design a filter algorithm to calculate the intersection of search results for different attributes, which can be used to support compound substring queries on multiple attributes. Detailed security analysis shows that our proposed scheme is privacy-preserving. In addition, extensive performance evaluations are also conducted, and the results demonstrate the efficiency of our proposed scheme.
Highlights
Security and Communication Networks an example of the compound query that a database DB includes n records f1, f2, . . . , fn and each record in it has ρ attributes A1, A2, . . . , Aρ, a user can send a compound substring query on two attributes: select f from DB where Aj like ∗ s1 ∗ and Ak like ∗ s2 ∗, to query records whose attributes Aj and Ak contain substring s1 and s2, respectively, where j and k belong to [1, ρ]
To address the above problems, in this paper, we propose a privacy-preserving Searchable symmetric encryption (SSE) scheme, which can efficiently support compound substring queries on multiple attributes
The main contributions of this paper are threefold: (i) First, based on the position heap technique, we design a tree-based index to support substring queries on a single attribute. is tree-based index can support two types of substring patterns: ∗s ∗ and s1 ∗ s2, where s, s1, and s2 represent queried substrings and ∗ represents any string of any length
Summary
We formalize the system model, security model, and identify our design goals. Qρ to the cloud server to retrieve a set of records F matching Q, where qj(1 ≤ j ≤ ρ) is a substring query for attribute Aj and Ω is a compound formula consisting of conjunctive expressions (i.e., ∩ ) and disjunctive expressions (i.e., ∪ ) on q1, . E duties of the cloud server include the following: (i) efficiently store database DB and index I and (ii) process compound substring query token Q and respond a set of matching records F⊆DB to the data user. Our design goal is to achieve an efficient and privacy-preserving SSE scheme supporting compound substring queries for the database. In order to achieve the above privacy requirement, additional computational costs will inevitably be incurred. erefore, in this work, we aim to reduce the query time to be linear with the length of the query token plus the size of matching results
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
