Multi‐User Boolean Keyword Searchable Encryption With Fine‐Grained Access Control for Cloud Storage

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.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-12-19
DOI
https://doi.org/10.1002/cpe.70511
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi‐User Boolean Keyword Searchable Encryption With Fine‐Grained Access Control for Cloud Storage

Ye Su, Wenchao Wang, Jing Qin, Xinyi Hou et al.
Concurrency and Computation Practice and Experience
Cryptography and Data Security
article

Multi‐User Boolean Keyword Searchable Encryption With Fine‐Grained Access Control for Cloud Storage

Ye Su, Wenchao Wang, Jing Qin, Xinyi Hou, Jixin Ma
article en

Abstract

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.

Concurrency and Computation Practice and ExperienceVol. 38(1)
Shandong University (CN), Shandong Normal University (CN), Shandong Management University (CN), University of Greenwich (GB)
Openalex Percentile: Top 19%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Multi‐User Boolean Keyword Searchable Encryption With Fine‐Grained Access Control for Cloud Storage — Ye Su, Wenchao Wang, et al. · Concurrency and Computation Practice and Experience (2025) | TGRS Research Map | TGRS