An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy
IEEE Transactions on Computers
Introduction to finite fields and their applications
Introduction to finite fields and their applications
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 key assignment scheme for access control in a hierarchy
Information Systems
Role-Based Access Control Models
Computer
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 lattice model of secure information flow
Communications of the ACM
Protection in operating systems
Communications of the ACM
Operating System Concepts
Secure key agreement for group communications
International Journal of Network Management
Lattice-Based Access Control Models
Computer
Flexible Access Control with Master Keys
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
ACM SIGOPS Operating Systems Review
Role-based access control for collaborative enterprise in peer-to-peer computing environments
Proceedings of the eighth ACM symposium on Access control models and technologies
Generalized Role-Based Access Control
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
On permissions, inheritance and role hierarchies
Proceedings of the 10th ACM conference on Computer and communications security
A scalable key-management scheme with minimizing key storage for secure group communications
International Journal of Network Management
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
Scalable and lightweight key distribution for secure group communications
International Journal of Network Management
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
Comparing the expressive power of access control models
Proceedings of the 11th ACM conference on Computer and communications security
Secure Group Communications Over Data Networks
Secure Group Communications Over Data Networks
Rule-Based RBAC with Negative Authorization
ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
Hierarchical key management scheme using polynomial interpolation
ACM SIGOPS Operating Systems Review
Efficient authenticated key agreement protocols resistant to a denial-of-service attack
International Journal of Network Management
Dynamic and efficient key management for access hierarchies
Proceedings of the 12th ACM conference on Computer and communications security
Scalable and fault-tolerant key agreement protocol for dynamic groups
International Journal of Network Management
Research: Dynamic key management schemes for access control in a hierarchy
Computer Communications
Group Key Management: From a Non-hierarchical to a Hierarchical Structure
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
| Hi-index | 0.00 |
Hierarchical access control (HAC) has been a fundamental problem in computer and network systems. Since Akl and Taylor proposed the first HAC scheme based on number theory in 1983, cryptographic key management techniques for HAC have appeared as a new and promising class of solutions to the HAC problem. Many cryptographic HAC schemes have been proposed in the past two decades. One common feature associated with these schemes is that they basically limited dynamic operations at the node level. In this paper, by introducing the innovative concept of 'access polynomial' and representing a key value as the sum of two polynomials in a finite field, we propose a new key management scheme for dynamic access hierarchy. The newly proposed scheme supports full dynamics at both the node level and user level in a uniform yet efficient manner. Furthermore, the new scheme allows access hierarchy to be a random structure and can be flexibly adapted to many other access models such as 'transfer down' and 'depth-limited transfer'.