An ID-based Hierarchical Access Control Scheme with Constant Size Public Parameter

Rang Zhou, Chunxiang Xu, Wanpeng Li, Jining Zhao

Research output: Contribution to journalArticlepeer-review

Abstract

Many ways are proposed to reduce the secret storage space of access control in hierarchy, but no one optimizes the public parameters which are only modified by CA. Length of each public parameter is one important factor for the size and utilization of storage space. The frequent changes on the maximum length of public parameter will be a weakness for stability, in dynamic key management. Number and length of changed public parameter are considered for the interaction between CA and trusted public platform in dynamic management. The paper proposes an improved scheme to optimize storage space of public parameter for each class from variable linear size to a small constant size. Our scheme has higher utilization, stability and efficiency on storage space of trusted public platform and needs less interaction between CA and trusted public platform. The security of this improved scheme is proved on key recovery model.
Original languageEnglish
Pages (from-to)960-968
JournalInternational Journal of Network Security
Volume18
Issue number5
Publication statusPublished - Sept 2016
Externally publishedYes

Bibliographical note

Acknowledgments
This work is supported by Science and Technology on Communication Security Laboratory Foundation (NO.9140C110301110C1103) and The Weaponry Equip-
ment Pre-Research Foundation, the PLA General Armament Department (NO.9140A04020311DZ02)

Fingerprint

Dive into the research topics of 'An ID-based Hierarchical Access Control Scheme with Constant Size Public Parameter'. Together they form a unique fingerprint.

Cite this