A separator theorem for graphs of bounded genus
Journal of Algorithms
An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy
IEEE Transactions on Computers
Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
On some cryptographic solutions for access control in a tree hierarchy
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Cryptographic implementation of a tree hierarchy for access control
Information Processing Letters
A cryptographic key generation scheme for multilevel data security
Computers and Security
Membership authentication for hierarchical multigroups using the extended Fiat-Shamir scheme
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Hierarchical classification as an aid to database and hit-list browsing
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Role-Based Access Control Models
Computer
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
A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy
IEEE Transactions on Knowledge and Data Engineering
A new dynamic key generation scheme for access control in a hierarchy
Nordic Journal of Computing
Flexible Access Control with Master Keys
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Low Cost Attacks on Tamper Resistant Devices
Proceedings of the 5th International Workshop on Security Protocols
Sibling Intractable Function Families and Their Applications (Extended Abstract)
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
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
On permissions, inheritance and role hierarchies
Proceedings of the 10th ACM conference on Computer and communications security
Enterprise Application Integration using a Component-based Architecture
COMPSAC '03 Proceedings of the 27th Annual International Conference on Computer Software and Applications
A Key Assignment Scheme for Controlling Access in Partially Ordered User Hierarchies
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
A Novel Key Management Scheme for Dynamic Access Control in a User Hierarchy
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Cryptographic key assignment schemes for any access control policy
Information Processing Letters
Hierarchical key management scheme using polynomial interpolation
ACM SIGOPS Operating Systems Review
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
A novel hierarchical key management scheme based on quadratic residues
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Key management for non-tree access hierarchies
Proceedings of the eleventh ACM symposium on Access control models and technologies
Provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 13th ACM conference on Computer and communications security
Efficient techniques for realizing geo-spatial access control
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Dual-Level Key Management for secure grid communication in dynamic and hierarchical groups
Future Generation Computer Systems
New constructions for provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 12th ACM symposium on Access control models and technologies
A data outsourcing architecture combining cryptography and access control
Proceedings of the 2007 ACM workshop on Computer security architecture
Over-encryption: management of access control evolution on outsourced data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A dynamic key management solution to access hierarchy
International Journal of Network Management
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)
Preserving confidentiality of security policies in data outsourcing
Proceedings of the 7th ACM workshop on Privacy in the electronic society
Group Key Management: From a Non-hierarchical to a Hierarchical Structure
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
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
MPISec I/O: Providing Data Confidentiality in MPI-I/O
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Efficient and secure distribution of massive geo-spatial data
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Scalable key management algorithms for location-based services
IEEE/ACM Transactions on Networking (TON)
Trade-Offs in Cryptographic Implementations of Temporal Access Control
NordSec '09 Proceedings of the 14th Nordic Conference on Secure IT Systems: Identity and Privacy in the Internet Age
Design of a lattice-based access control scheme
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Encryption policies for regulating access to outsourced data
ACM Transactions on Database Systems (TODS)
Data protection in outsourcing scenarios: issues and directions
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
An opportunistic authority evaluation scheme for data security in crisis management scenarios
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Data privacy - problems and solutions
ICISS'07 Proceedings of the 3rd international conference on Information systems security
Achieving secure, scalable, and fine-grained data access control in cloud computing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient fine-grained data access control in wireless sensor networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Secure cross-domain data sharing architecture for crisis management
Proceedings of the tenth annual ACM workshop on Digital rights management
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Efficient multi-dimensional key management in broadcast services
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
An efficient key assignment scheme for access control in a large leaf class hierarchy
Information Sciences: an International Journal
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Efficient provably-secure hierarchical key assignment schemes
Theoretical Computer Science
Provably secure key assignment schemes from factoring
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
A secure and efficient role-based access policy towards cryptographic cloud storage
WAIM'11 Proceedings of the 12th international conference on Web-age information management
EventGuard: A System Architecture for Securing Publish-Subscribe Networks
ACM Transactions on Computer Systems (TOCS)
An efficient key assignment scheme for access control in a hierarchy
ICISS'06 Proceedings of the Second international conference on Information Systems Security
Detecting flaws in dynamic hierarchical key management schemes using specification animation
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Privacy enhanced data outsourcing in the cloud
Journal of Network and Computer Applications
Efficient provably-secure hierarchical key assignment schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Incorporating temporal capabilities in existing key management schemes
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Simple, efficient and strongly KI-Secure hierarchical key assignment schemes
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Improving security and efficiency of time-bound access to outsourced data
Proceedings of the 6th ACM India Computing Convention
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
Role-based access control to outsourced data in cloud computing
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
Access control and query verification for untrusted databases
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
| Hi-index | 0.00 |
The problem of key management in an access hierarchy has elicited much interest in the literature. The hierarchy is modeled as a set of partially ordered classes (represented as a directed graph), and a user who obtains access (i.e., a key) to a certain class can also obtain access to all descendant classes of her class through key derivation. Our solution to the above problem has the following properties: (i) only hash functions are used for a node to derive a descendant's key from its own key; (ii) the space complexity of the public information is the same as that of storing the hierarchy; (iii) the private information at a class consists of a single key associated with that class; (iv) updates (revocations, additions, etc.) are handled locally in the hierarchy; (v) the scheme is provably secure against collusion; and (vi) key derivation by a node of its descendant's key is bounded by the number of bit operations linear in the length of the path between the nodes. Whereas many previous schemes had some of these properties, ours is the first that satisfies all of them. Moreover, for trees (and other "recursively decomposable" hierarchies), we are the first to achieve a worst- and average-case number of bit operations for key derivation that is exponentially better than the depth of a balanced hierarchy (double-exponentially better if the hierarchy is unbalanced, i.e., "tall and skinny"); this is achieved with only a constant increase in the space for the hierarchy. We also show how with simple modifications our scheme can handle extensions proposed by Crampton of the standard hierarchies to "limited depth" and reverse inheritance [13]. The security of our scheme relies only on the use of pseudo-random functions.