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
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
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
Provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 13th ACM conference on Computer and communications security
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
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)
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Key hierarchies for hierarchical access control in secure group communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient and secure distribution of massive geo-spatial data
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Practical and efficient cryptographic enforcement of interval-based access control policies
ACM Transactions on Information and System Security (TISSEC)
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Efficient provably-secure hierarchical key assignment schemes
Theoretical Computer Science
Simple, efficient and strongly KI-Secure hierarchical key assignment schemes
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Hi-index | 0.00 |
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 show an encryption based 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 reduce key derivation time at the expense of an increment of the amount of public information, by improving a previous result. - Finally, we show a construction 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.