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
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Trade-offs in non-reversing diameter
Nordic Journal of Computing
Directed graphs requiring large numbers of shortcuts
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Dynamic and efficient key management for access hierarchies
Proceedings of the 12th ACM conference on Computer and communications security
Characterization of Security Notions for Probabilistic Private-Key Encryption
Journal of Cryptology
Key management for non-tree access hierarchies
Proceedings of the eleventh ACM symposium on Access control models and technologies
On Key Assignment for Hierarchical Access Control
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
New constructions for provably-secure time-bound hierarchical key assignment schemes
Theoretical Computer Science
Dynamic and Efficient Key Management for Access Hierarchies
ACM Transactions on Information and System Security (TISSEC)
Variations on a theme by Akl and Taylor: Security and tradeoffs
Theoretical Computer Science
Forward-security in private-key cryptography
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Provably-Secure Time-Bound Hierarchical Key Assignment Schemes
Journal of Cryptology
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Generic transformation for scalable broadcast encryption schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
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
Efficient provably-secure hierarchical key assignment schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
CloudHKA: a cryptographic approach for hierarchical access control in cloud computing
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Hi-index | 5.23 |
A hierarchical key assignment scheme is a method to assign some private information and encryption keys to a set of classes in a partially ordered hierarchy, in such a way that the private information of a higher class can be used to derive the keys of all classes lower down in the hierarchy. In this paper we design and analyze hierarchical key assignment schemes which are provably secure and support dynamic updates to the hierarchy with local changes to the public information and without requiring any private information to be re-distributed. -We first consider the problem of constructing a hierarchical key assignment scheme by using as a building block a symmetric encryption scheme. We propose a new construction which is provably secure with respect to key indistinguishability, requires a single computational assumption, and improves on previous proposals. -Then, we show how to construct a hierarchical key assignment scheme by using as a building block a public-key broadcast encryption scheme. In particular, one of our constructions provides constant private information and public information linear in the number of classes in the hierarchy.