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
Elements of information theory
Elements of information theory
Cryptographic key assignment scheme for access control in a hierarchy
Information Systems
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Concrete Math
Cryptographic key assignment schemes for any access control policy
Information Processing Letters
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
Access control in user hierarchy based on elliptic curve cryptosystem
Information Sciences: an International Journal
| Hi-index | 0.00 |
A key assignment scheme is a protocol to assign encryption keys and some private information to a set of disjoint user classes in a system organized as a partially ordered hierarchy. The encryption key enables each class to protect its data by means of a symmetric cryptosystem, whereas, the private information allows each class to compute the keys assigned to classes lower down in the hierarchy. In this paper we consider a particular kind of a hierarchy: the complete rooted tree hierarchy. We propose a key assignment scheme which is not based on unproven specific computational assumptions and that guarantees security against an adversary controlling a coalition of classes of a certain size. Moreover, the proposed scheme is optimal both with respect to the size of the information kept secret by each class and with respect to the randomness needed to set up the scheme.