An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy
IEEE Transactions on Computers
On key agreement protocols based on tamper-proof hardware
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)
A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy
IEEE Transactions on Knowledge and Data Engineering
Flexible Access Control with Master Keys
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A Key Assignment Scheme for Controlling Access in Partially Ordered User Hierarchies
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
A Novel Key Management Scheme for Dynamic Access Control in a User Hierarchy
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Hierarchical key management scheme using polynomial interpolation
ACM SIGOPS Operating Systems Review
Efficient Secret Sharing with Access Structures in a Hierarchy
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
Dynamic and efficient key management for access hierarchies
Proceedings of the 12th ACM conference on Computer and communications security
Managing user relationships in hierarchies for information system security
Decision Support Systems
Comments on a cryptographic key assignment scheme
Computer Standards & Interfaces
Research: Dynamic key management schemes for access control in a hierarchy
Computer Communications
Research note: Comments on `dynamic key management schemes for access control in a hierarchy'
Computer Communications
| Hi-index | 0.00 |
We survey the literature for access control schemes in a user hierarchy. Some schemes have already been shown to be insecure or incorrect. Many schemes assume very restrictive subordinating relationships existing in a hierarchy where users are grouped into partially ordered relationships without taking resources into consideration. We believe that a practical access control scheme should support access control in a lattice where users and resources are both together grouped into partially ordered relationships. In this paper, we present a scheme to achieve this goal. We also study existing schemes for their efficiency and performance. Based on the results of the study, we design an efficient scheme to support dynamic key management.