Abstract
The notion of Multi-Key Searchable Encryption (MKSE) enables data owners to outsource their data into a cloud server, while supporting fine-grained data sharing with the authorized users. Note that the traditional MKSE is vulnerable to data leakage. That is, the malicious data owner may collude with the server and recover the search queries of authorized users. Recently, Hamlin et al. (PKC'18) presented a new MKSE construction that can ensure data privacy between data owner and authorized users, where the share key is generated depending on data owner, authorized user and the specific document. However, their scheme cannot support verifiable search in the case of the malicious cloud server. In this paper, we propose a new verifiable MKSE (VMKSE) scheme by leveraging Garbled Bloom Filter, which can simultaneously support verifiability of search result and secure data sharing in multi-user setting. Compared to the state-of-the-art solution, the proposed scheme is superior in efficiency and verifiability. The experiment results demonstrate the efficiency of our scheme.
Highlights
Cloud computing enables client to enjoy high-quality data storage and computing services in a pay-as-you-go manner
We present the notion of verifiable MKSE (VMKSE) scheme
VERIFIABLE MULTI-KEY SEARCHABLE ENCRYPTION SCHEME We firstly introduce the high-level idea of our construction
Summary
Cloud computing enables client to enjoy high-quality data storage and computing services in a pay-as-you-go manner. In single-user SSE [8], [14]–[16], the data owner outsources the encrypted documents and later only allows himself to perform search. While in multi-user SSE [17]–[21], the data owner outsources the encrypted documents and selectively shares them with a group of authorized users In this case, any authorized user needs provide valid search tokens to the server and get all the matched documents encrypted with different keys. Liu et al [28] presented a verifiable SSE scheme based on the approach of key aggregation and the authenticated data structure Bloom Filter under the multi-owner setting, and their scheme can execute even if when the server returned an empty set.
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.
