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
Elements of information theory
Elements of information theory
Cryptographic key assignment scheme for access control in a hierarchy
Information Systems
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 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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A new key assignment scheme for enforcing complicated access control policies in hierarchy
Future Generation Computer Systems - Selected papers from CCGRID 2002
Controlling access in large partially ordered hierarchies using cryptographic keys
Journal of Systems and Software
Cryptographic key assignment schemes for any access control policy
Information Processing Letters
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
Provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 13th ACM conference on Computer and communications security
| Hi-index | 0.00 |
In this paper we propose an information-theoretic approach to the access control problem in a scenario where a group of users is divided into a number of disjoint classes. The set of rules that specify the information flow between different user classes in the system defines an access control policy. An access control policy can be implemented by using a key assignment scheme, where a trusted central authority (CA) assigns an encryption key and some private information to each class.We consider key assignment schemes where the key assigned to each class is unconditionally secure with respect to an adversary controlling a coalition of classes of a limited size. Our schemes are characterized by a security parameter r, the size of the adversary coalition. We show lower bounds on the size of the private information that each class has to store and on the amount of randomness needed by the CA to set up any key assignment scheme. Finally, we propose some optimal constructions for unconditionally secure key assignment schemes.