Applying Time-Bound Hierarchical Key Assignment in Wireless Sensor Networks
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.
KeywordsSensor Network Sensor Node Wireless Sensor Network Central Authority Multicast Session
Unable to display preview. Download preview PDF.
- 4.Shehab, M., Bertino, E., Ghafoor, A.: Efficient hierarchical key generation and key diffusion for sensor networks. In: Proc. 2nd Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON 2005), pp. 76–84 (2005)Google Scholar
- 9.Li, Z., Gong, G.: A survey on security in wireless sensor networks. Technical Report, University of Waterloo, CACR 2008-20 (October 2008)Google Scholar
- 11.Sorniotti, A., Molva, R., Gomez, L.: Efficient access control for wireless sensor data. In: Proc. 19th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2008), pp. 1–5 (2008)Google Scholar