Liu, Jinlu, Zhao, Bo, Qin, Jing ORCID: 0000-0003-2380-0396, Hou, Xinyi and Ma, Jixin ORCID: 0000-0001-7458-7412 (2023) Key-aggregate searchable encryption supporting conjunctive queries for flexible data sharing in the cloud. Information Sciences:119336. ISSN 0020-0255 (doi:https://doi.org/10.1016/j.ins.2023.119336)

PDF (Pre-proof accepted (preprint)*) 43053_MA_Key_aggregate_searchable_encryption_supporting_conjunctive_queries_for_flexible_data.pdf - Accepted Version Restricted to Repository staff only until 22 June 2024. Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) | Request a copy

Abstract

Searchable encryption (SE) meets users' demand for the keyword search on encrypted data. Key-aggregate searchable encryption (KASE) improves data owners' ability to selectively share encrypted data with users. In KASE, the data owner encrypts different documents/document classes with distinct keys and can share any selected subset of documents by simply transmitting an aggregate key to the user. The user only uploads an aggregate trapdoor to the server for querying these shared documents. However, the existing KASE schemes have some limitations: the security definition is incomplete, only single-keyword search is supported, and the provable security scheme relies on the random oracle model. For these reasons, in this paper, we propose the Key-Aggregate Searchable Encryption supporting Conjunctive Queries (KASE-CQ) framework and its two security models: indistinguishability against selective-document chosen keyword attack and existential unforgeability against selective-document chosen keyword attack. These models reflect the indistinguishability of ciphertext and the un-forgeability of the aggregate key, respectively. Our system supports flexible data sharing and the conjunctive keyword search on encrypted data. Furthermore, we design a concrete KASE-CQ construction, which can be proven secure in the standard model. We also demonstrate that our construction is secure against the insider trapdoor attack presented by Zhou et al. [40]. Finally, performance analysis and comparisons with Cui et al.'s scheme [10] illustrate the superior efficiency of our scheme.

Item Type:	Article
Uncontrolled Keywords:	data sharing; key-aggregate; conjunctive keyword query; standard model
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group:	Faculty of Engineering & Science Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Last Modified:	28 Jun 2023 14:23
URI:	http://gala.gre.ac.uk/id/eprint/43053

Actions (login required)

View Item

Downloads