Verifiable attribute-based multi-keyword ranked search scheme in blockchain

Abstract In recent years, cloud storage has gradually become a promising tool for providing data sharing and data storage services with privacy protection. However, to enable users to search over encrypted data and to enable data owners to perform fine-grained search authorization on their encrypted files is still a great challenge. Although attribute-based keyword search (ABKS) is a well-received solution to the challenge, the direct adoption of the traditional ABKS schemes in cloud storage suffers two issues. The first problem is the lack of integrity verification of search results. That is, the users cannot verify whether the server has actually performed a search without compromise. The second issue is that the retrieval modes of most ABKS schemes are not flexible enough. Aiming at the above two issues, a verifiable ABKS scheme is proposed herein. Besides, we proposed security definitions for two types of adversaries and proved that the proposed scheme is verifiable and able of resisting outside keyword guessing attack and chosen keyword attack. Finally, we carried out all-round simulations with actual data set, showing that the proposed scheme has advantage in efficiency over other similar schemes.

Authors

Institutions

Publication Details

Journal
The Computer Journal
Published
2024-12-27
DOI
https://doi.org/10.1093/comjnl/bxae128
Citations
3
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
1.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Verifiable attribute-based multi-keyword ranked search scheme in blockchain

Jin Pan, Chunlu Zhao, Yan Liu, Yang Chen
3 citations
The Computer Journal
Cryptography and Data Security
1.04
article

Verifiable attribute-based multi-keyword ranked search scheme in blockchain

Jin Pan, Chunlu Zhao, Yan Liu, Yang Chen
article en
3 citations

Abstract

Abstract In recent years, cloud storage has gradually become a promising tool for providing data sharing and data storage services with privacy protection. However, to enable users to search over encrypted data and to enable data owners to perform fine-grained search authorization on their encrypted files is still a great challenge. Although attribute-based keyword search (ABKS) is a well-received solution to the challenge, the direct adoption of the traditional ABKS schemes in cloud storage suffers two issues. The first problem is the lack of integrity verification of search results. That is, the users cannot verify whether the server has actually performed a search without compromise. The second issue is that the retrieval modes of most ABKS schemes are not flexible enough. Aiming at the above two issues, a verifiable ABKS scheme is proposed herein. Besides, we proposed security definitions for two types of adversaries and proved that the proposed scheme is verifiable and able of resisting outside keyword guessing attack and chosen keyword attack. Finally, we carried out all-round simulations with actual data set, showing that the proposed scheme has advantage in efficiency over other similar schemes.

The Computer JournalVol. 68(5)
National Computer Network Emergency Response Technical Team/Coordination Center of Chinar (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 18%
Cryptography and Data Security
1.04
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.