Time-Bound Hierarchical Key Assignment: An Overview

Wen Tao ZHU
Robert H. DENG
Jianying ZHOU
Feng BAO

IEICE TRANSACTIONS on Information and Systems   Vol.E93-D    No.5    pp.1044-1052
Publication Date: 2010/05/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E93.D.1044
Print ISSN: 0916-8532
Type of Manuscript: Special Section INVITED PAPER (Special Section on Information and Communication System Security)
information security,  access control,  time-bound hierarchical cryptographic key management,  

Full Text: PDF(248.7KB)>>
Buy this Article

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.

open access publishing via