Cryptographic implementation of a tree hierarchy for access control
Information Processing Letters
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Iolus: a framework for scalable secure multicasting
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
A cryptographic solution to implement access control in a hierarchy and more
SACMAT '02 Proceedings of the seventh ACM symposium on Access control models and technologies
On Key Agreement and Conference Key Agreement
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
Chinese Remainder Theorem Based Hierarchical Access Control for Secure Group Communication
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Hydra: A Decentralised Group Key Management
WETICE '02 Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises
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
Sibling Intractable Function Families and Their Applications (Extended Abstract)
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Hierarchical key management scheme using polynomial interpolation
ACM SIGOPS Operating Systems Review
Secure Group Communication Based Scheme for Differential Access Control in Dynamic Environments
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Key management for content access control in a hierarchy
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Design of a Cryptography Based Secure File System
IEEE Transactions on Software Engineering
An Efficient Key Management Scheme for Access Control in a User Hierarchy
ITCS '09 Proceedings of the 2009 International Conference on Information Technology and Computer Science - Volume 01
Key management scheme for multi-layer secure group communication
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
A Novel Secure Key Management Module for Hierarchical Clustering Wireless Sensor Networks
CIMSIM '11 Proceedings of the 2011 Third International Conference on Computational Intelligence, Modelling & Simulation
Multicast group behavior in the Internet's multicast backbone (MBone)
IEEE Communications Magazine
Scalable secure one-to-many group communication using dual encryption
Computer Communications
Reliable Key Management and Data Delivery Method in Multicast Over Wireless IPv6 Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The content access control problem appears in any context with a set of users and resources. The difference in access rights of the users defines classes, where members of a given class have exactly the same access rights. A hierarchy can be defined on the classes. Linear hierarchies constitute a particularly interesting type of hierarchies. They appear in a wide range of applications such as secure multi-layered data streaming and communications within security corps. Many proposals have dealt with key management issues for tree hierarchies but they result in unjustified overhead when applied to linear hierarchies. In this paper, we discuss the general problem of Content Access Control in a Hierarchy (CACH). Thereafter, we present the main requirements in key management to ensure confidentiality in linear hierarchies. In particular, we define a model to make a uniform and coherent description of the existing key management schemes. Thereafter, we propose an efficient key management scheme for linear hierarchies that not only provides mechanisms to manage membership changes but also hierarchy shape changes, and we describe it using our model. We conduct intensive simulations which show that our solution scales very well in terms of storage, bandwidth, and computation. Finally, we determine the complexity of some well-known key management schemes and compare them to the complexity of our scheme. This comparison shows that our scheme offers efficient compromises in complexity and overall overheads.