Time-bound Hierarchical Key Assignment: An Overview
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.
information security, access control, time-bound hierarchical cryptographic key management
Information Security and Trust
IEICE Transactions on Information and Systems
Institute of Electronics, Information and Communication Engineers
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. Research Collection School Of Information Systems.
Available at: http://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 License.
This document is currently not available here.