Skip navigation

Multi‐user Boolean Keyword Searchable Encryption with fine‐grained access control for Cloud storage

Multi‐user Boolean Keyword Searchable Encryption with fine‐grained access control for Cloud storage

Hou, Xinyi ORCID logoORCID: https://orcid.org/0009-0002-9936-9854, Su, Ye, Qin, Jing ORCID logoORCID: https://orcid.org/0000-0003-2380-0396, Wang, Wenchao and Ma, Jixin ORCID logoORCID: https://orcid.org/0000-0001-7458-7412 (2025) Multi‐user Boolean Keyword Searchable Encryption with fine‐grained access control for Cloud storage. Concurrency and Computation: Practice and Experience, 38 (1):e70511. ISSN 1532-0626 (Print), 1532-0634 (Online) (doi:10.1002/cpe.70511)

[thumbnail of Accepted Manuscript] PDF (Accepted Manuscript)
52026 MA_Multi‐User_Boolean_Keyword_Searchable_Encryption_With_Fine‐Grained_Access_Control_(AAM)_2025.pdf - Accepted Version
Restricted to Repository staff only until 19 December 2026.

Download (9MB) | Request a copy

Abstract

Searchable Encryption (SE) enables users to perform searches on encrypted data while preserving data privacy. Since cloud servers are platforms that provide services for a large number of users, and data owners require access control over their data, SE schemes that support multi‐user settings and access control are therefore more suitable for cloud storage. However, in existing SE schemes that support multi‐user settings and access control, most only support single‐keyword or conjunctive keyword searches, and the search time grows linearly with the total amount of data. These limitations negatively impact both the accuracy and efficiency of search operations. This work proposes an SE scheme specifically designed for multi‐user settings. Data owners can enforce fine‐grained access control policies, while a specialized retrieval structure allows the cloud to assist users in performing Boolean keyword searches with improved efficiency. The search complexity of the proposed scheme is , where denotes the number of files relevant to the queried keyword. We demonstrate the scheme's effectiveness and practicality through performance analysis.

Item Type: Article
Uncontrolled Keywords: access control, Boolean keyword search, cloud computing, multi-user, searchable encryption
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
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: 07 Jan 2026 16:13
URI: https://gala.gre.ac.uk/id/eprint/52026

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics