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
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Cryptographic sealing for information secrecy and authentication
Communications of the ACM
Password authentication with insecure communication
Communications of the ACM
A user authentication scheme not requiring secrecy in the computer
Communications of the ACM
A high security log-in procedure
Communications of the ACM
Cryptography and data security
Cryptography and data security
Time Sharing Computer Systems
New Key Generation Algorithms for Multilevel Security
SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
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
Key management for content access control in a hierarchy
Computer Networks: The International Journal of Computer and Telecommunications Networking
Over-encryption: management of access control evolution on outsourced data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
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 generic algebraic model for the analysis of cryptographic-key assignment schemes
FPS'12 Proceedings of the 5th international conference on Foundations and Practice of Security
Hi-index | 0.00 |
We consider the access control problem in a system where users and information items are classified into security classes organized as a rooted tree, with the most privileged security class at the root. In practice we expect such a tree to be quite broad and shallow. It is also inevitable that new security classes will need to be added as the needs of the organization evolve. We compare some cryptographic techniques which have been proposed in the literature for solution of this problem.