An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy
IEEE Transactions on Computers
Cryptographic implementation of a tree hierarchy for access control
Information Processing Letters
A cryptographic key generation scheme for multilevel data security
Computers and Security
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Research: Dynamic key management schemes for access control in a hierarchy
Computer Communications
An efficient key assignment scheme based on one-way hash function in a user hierarchy
Journal of Computer Science and Technology
Efficient key management for cryptographically enforced access control
Computer Standards & Interfaces
Design of a lattice-based access control scheme
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Scalable key management for secure multicast communication in the mobile environment
Pervasive and Mobile Computing
A novel hierarchical key management scheme based on quadratic residues
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.24 |
In 1997, Lin proposed a new dynamic access control scheme with a central authority for users organized in a hierarchy. The author claimed that the new scheme has many advantages, e.g. any class can change its group key for security reasons without affecting the others. However, this paper will show that once the old group key of a class is exposed, the newly chosen group key can be easily derived by the old key. Moreover, we shall show that if the identity of a class has a few bits different from those of the other classes, a user in the class can easily derive the group keys of these classes to which he/she is not entitled.