Applying Time-Bound Hierarchical Key Assignment in Wireless Sensor Networks
Conference Proceeding Article
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.
Cryptographic key, Distributed systems, Future research directions, Hierarchical key assignment, Low-cost sensors, Node compromise, Privacy protection, Resource-constrained, Technical challenges, Temporal restrictions, Time slots, Time variant, Wireless sensor
Information and Communications Security: 13th International Conference, ICICS 2011, Beijing, China, November 23-26: Proceedings
City or Country
ZHU, Wentao; DENG, Robert H.; ZHOU, Jianying; and BAO, Feng.
Applying Time-Bound Hierarchical Key Assignment in Wireless Sensor Networks. (2011). Information and Communications Security: 13th International Conference, ICICS 2011, Beijing, China, November 23-26: Proceedings. 7043, 306-318. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1420