arbiter
JournalsPricingAccount

FUR-HABE

Xiaohui Yang & Ya'nan Tao

International Journal of Information Security and Privacy2025https://doi.org/10.4018/ijisp.365602article
ABDC C
Weight
0.50

What the paper says

An effective method to protect cloud data is access control. But, the efficiency of key distribution by a single authority is low, and it is difficult to achieve dynamic attribute revocation when system properties are shared by multiple users. Existing attribute revocation mechanisms face challenges in terms of functional complexity and computational efficiency, which hinder their practical application. To address these issues, this paper put forward a Hierarchical CP-ABE scheme with Traceable Fine-grained User Revocation for Cloud Storage (FUR-HABE). In this scheme, most of the decryption calculations are outsourced to cloud servers. It employs a layered key authorization mechanism to provide flexible and scalable key delegation. Additionally, the scheme supports key encapsulation key (KEK) attribute revocation and user revocation to accommodate different revocation needs, enabling flexible revocation.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.4018/ijisp.365602

Or copy a formatted citation

@article{xiaohui2025,
  title        = {{FUR-HABE}},
  author       = {Xiaohui Yang & Ya'nan Tao},
  journal      = {International Journal of Information Security and Privacy},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.4018/ijisp.365602},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

FUR-HABE

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.