.png){kind=icon}
.png){kind=icon}
Return
SHRD: A Scalable Scheme for Hierarchical File Sharing With Rank-Aware Dissemination
.png){kind=icon}
PRE
AI
S
J
C
F
H
K
DOI：10.1109/tifs.2026.3716232.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the rapid development of cloud storage services, the importance of file sharing and rank-aware dissemination has grown significantly. In practical application scenarios such as healthcare and government, file sharing and rank-aware dissemination often exhibit complex hierarchical structures. Although attribute-based conditional proxy re-encryption has been regarded as a promising approach to achieve hierarchical file sharing and dissemination, existing studies suffer from two major limitations. 1) These studies lack scalability: the computation and communication overhead increases linearly with the amount of hierarchical files, making it infeasible to share multiple files simultaneously. 2) Hierarchical files for different users’ ranks cannot be disseminated all at once; instead, multiple rounds of iteration interactions are required. To address these issues, we propose SHRD, an efficient and scalable scheme for hierarchical file sharing with fine-grained rank-aware dissemination. Unlike existing CP-ABE schemes that require separate secret values for each hierarchical file—leading to linear encryption overhead—SHRD introduces a key hierarchy based on symmetric keys. By establishing hierarchical relationships among these symmetric keys, SHRD enables a single encryption operation to cover multiple files, eliminating redundant encryptions. Furthermore, we design a rank-aware dissemination tree that integrates rank conditions directly into the re-encryption policy. This allows a data disseminator to generate one re-encryption key for all files across different ranks, avoiding the multiplicative re-encryption overhead that would result from a naive combination of AB-CPRE with hierarchical structures. Finally, we conduct the security analysis of our SHRD scheme under the IND-ID-CPA model. Comprehensive performance evaluations demonstrate that our scheme outperforms state-of-the-art studies in terms of computation and communication efficiency. Notably, both the computation and communication complexities of our scheme remain constant regardless of the number of files being shared.
Keywords:
Hierarchical file sharing
rank-aware dissemination
attribute-based conditional proxy re-encryption
Journal
IF:
8
Papers:
5.2K
Citations:
2.3W
Organization
Cited Papers