Cryptographic implementation of a tree hierarchy for access control
Information Processing Letters
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Revocation and Tracing Schemes for Stateless Receivers
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
MARKS: Zero Side Effect Multicast Key Management Using Arbitrarily Revealed Key Sequences
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
A secure hierarchical model for sensor network
ACM SIGMOD Record
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks
ACM Transactions on Sensor Networks (TOSN)
AMUSE: autonomic management of ubiquitous e-Health systems
Concurrency and Computation: Practice & Experience - Selected Papers from the 2005 U.K. e-Science All Hands Meeting (AHM 2005)
On the security of group communication schemes
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Sensor network security: a survey
IEEE Communications Surveys & Tutorials
Key management issues in wireless sensor networks: current proposals and future developments
IEEE Wireless Communications
Location-based compromise-tolerant security mechanisms for wireless sensor networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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.