Fine-Grained Authorized Encrypted-Data Retrieval Mechanism Based on Boolean Query Searchable KP-ABE Framework

To improve the efficiency of searching and retrieving encrypted data while minimizing the computational burden on users’ devices within the Key-Policy Attribute-Based Encryption (KP-ABE) framework, we introduce a new scheme called FineDReaM that is a novel Boolean query searchable KP-ABE mechanism. This method supports comprehensive Boolean search capabilities over encrypted content, maintains keyword privacy, ensures only authorized users can search, enables outsourced decryption, and allows users to verify both search results and outsourced decryption—all in one unified system. FineDReaM is resistant to keyword guessing attacks for both search tokens and ciphertexts, so unauthorized parties cannot deduce sensitive keywords. Data access is strictly limited to authorized users, and the scheme is designed so that user-side decryption remains fast and efficient. Additionally, FineDReaM includes a non-interactive verification mechanism, empowering users to independently confirm the integrity of both search results and outsourced decryption, without the need to contact a third party. We also introduce robust and generalized security definitions that consider various attack scenarios. Our security analysis demonstrates that FineDReaM achieves not just data confidentiality and keyword privacy, but also strong guarantees of verifiability under the random oracle model.

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-10-15
DOI
https://doi.org/10.1109/jiot.2025.3622052
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

Fine-Grained Authorized Encrypted-Data Retrieval Mechanism Based on Boolean Query Searchable KP-ABE Framework

IEEE Internet of Things Journal
Cryptography and Data Security
article

Fine-Grained Authorized Encrypted-Data Retrieval Mechanism Based on Boolean Query Searchable KP-ABE Framework

article en

Abstract

To improve the efficiency of searching and retrieving encrypted data while minimizing the computational burden on users’ devices within the Key-Policy Attribute-Based Encryption (KP-ABE) framework, we introduce a new scheme called FineDReaM that is a novel Boolean query searchable KP-ABE mechanism. This method supports comprehensive Boolean search capabilities over encrypted content, maintains keyword privacy, ensures only authorized users can search, enables outsourced decryption, and allows users to verify both search results and outsourced decryption—all in one unified system. FineDReaM is resistant to keyword guessing attacks for both search tokens and ciphertexts, so unauthorized parties cannot deduce sensitive keywords. Data access is strictly limited to authorized users, and the scheme is designed so that user-side decryption remains fast and efficient. Additionally, FineDReaM includes a non-interactive verification mechanism, empowering users to independently confirm the integrity of both search results and outsourced decryption, without the need to contact a third party. We also introduce robust and generalized security definitions that consider various attack scenarios. Our security analysis demonstrates that FineDReaM achieves not just data confidentiality and keyword privacy, but also strong guarantees of verifiability under the random oracle model.

IEEE Internet of Things JournalVol. 13(2)
National Institute of Technology Warangal (IN)
Peace, Justice and strong institutions
Openalex Percentile: Top 24%
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.