Applying time-bound hierarchical key assignment in wireless sensor networks

  • Authors:
  • Wen Tao Zhu;Robert H. Deng;Jianying Zhou;Feng Bao

  • Affiliations:
  • State Key Lab of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, China;School of Information Systems, Singapore Management University, Singapore;Cryptography and Security Department, Institute for Infocomm Research, Singapore;Cryptography and Security Department, Institute for Infocomm Research, Singapore

  • Venue:
  • ICICS'11 Proceedings of the 13th international conference on Information and communications security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Access privileges in distributed systems can be effectively organized as a partial-order hierarchy that consists of distinct security classes, and 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 explore applications of time-bound hierarchical key assignment in a wireless sensor network environment where there are a number of resource-constrained low-cost sensor nodes. We show time-bound hierarchical key assignment is a promising technique for addressing multiple aspects of sensor network security, such as data privacy protection and impact containment under node compromise. We also present the technical challenges and indicate future research directions.