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
Algorithmic number theory
Cryptanalysis of YCN key assignment scheme in a hierarchy
Information Processing Letters
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Controlling access in large partially ordered hierarchies using cryptographic keys
Journal of Systems and Software
Unconditionally secure key assignment schemes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Research: Dynamic key management schemes for access control in a hierarchy
Computer Communications
A cryptographic key assignment scheme in a hierarchy for access control
Mathematical and Computer Modelling: An International Journal
Dynamic and efficient key management for access hierarchies
Proceedings of the 12th ACM conference on Computer and communications security
Key management for non-tree access hierarchies
Proceedings of the eleventh ACM symposium on Access control models and technologies
Unconditionally secure key assignment schemes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 13th ACM conference on Computer and communications security
Access control in user hierarchy based on elliptic curve cryptosystem
Information Sciences: an International Journal
Dynamic and Efficient Key Management for Access Hierarchies
ACM Transactions on Information and System Security (TISSEC)
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
Variations on a theme by Akl and Taylor: Security and tradeoffs
Theoretical Computer Science
Unconditionally secure key assignment schemes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Encryption policies for regulating access to outsourced data
ACM Transactions on Database Systems (TODS)
Data privacy - problems and solutions
ICISS'07 Proceedings of the 3rd international conference on Information systems security
A new key assignment scheme for access control in a complete tree hierarchy
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Enforcing the security of a time-bound hierarchical key assignment scheme
Information Sciences: an International Journal
| Hi-index | 0.89 |
The access control problem deals with the management of sensitive information among a number of users who are classified according to their suitability in accessing the information in a computer system. The set of rules that specify the information flow between different user classes in the system defines an access control policy. Akl and Taylor first considered the access control problem in a system organized as a partially ordered hierarchy. They proposed a cryptographic key assignment scheme, where each class is assigned an encryption key that can be used, along with some public parameters generated by a central authority, to compute the key assigned to any class lower down in the hierarchy. Subsequently, many researchers have proposed schemes that either have better performances or allow insertion and deletion of classes in the hierarchy.In this paper we show how to construct a cryptographic key assignment scheme for any arbitrary access control policy. Our construction uses as a building block a cryptographic key assignment scheme for partially ordered hierarchies. The security of our scheme holds with respect to adversaries of limited computing power and directly derives from the security of the underlying scheme for partially ordered hierarchies. Moreover, the size of the keys assigned to classes in our scheme is exactly the same as in the underlying scheme.