Publication Type
Journal Article
Version
acceptedVersion
Publication Date
5-2010
Abstract
The access privileges in distributed systems can be effectively organized as a partial-order hierarchy that consists of distinct security classes, and the access rights are often designated with certain temporal restrictions. The time-bound hierarchical key assignment problem is to assign distinct cryptographic keys to distinct security classes according to their privileges so that users from a higher class can use their class key to derive the keys of lower classes, and these keys are time-variant with respect to sequentially allocated temporal units called time slots. In this paper, we present the involved principle, survey the state of the art, and particularly, look into two representative approaches to time-bound hierarchical key assignment for in-depth case studies.
Keywords
information security, access control, time-bound hierarchical cryptographic key management
Discipline
Information Security
Research Areas
Information Security and Trust
Publication
IEICE Transactions on Information and Systems
Volume
E93-D
Issue
5
First Page
1044
Last Page
1052
ISSN
0916-8532
Identifier
10.1587/transinf.E93.D.1044
Publisher
Institute of Electronics, Information and Communication Engineers
Citation
ZHU, Wen Tao; DENG, Robert H.; Zhou, Jianying; and Bao, Feng.
Time-bound Hierarchical Key Assignment: An Overview. (2010). IEICE Transactions on Information and Systems. E93-D, (5), 1044-1052.
Available at: https://ink.library.smu.edu.sg/sis_research/631
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://dx.doi.org/10.1587/transinf.E93.D.1044