Simple, efficient and strongly KI-Secure hierarchical key assignment schemes

Authors:
Eduarda S. V. Freire;Kenneth G. Paterson;Bertram Poettering
Affiliations:
Information Security Group, Royal Holloway, University of London, U.K.;Information Security Group, Royal Holloway, University of London, U.K.;Information Security Group, Royal Holloway, University of London, U.K.
Venue:
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Year:
2013

Citing 20
Cited 0

An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy

IEEE Transactions on Computers
How to construct random functions

Journal of the ACM (JACM)
A simple unpredictable pseudo random number generator

SIAM Journal on Computing
An efficient probabilistic public key encryption scheme which hides all partial information

Proceedings of CRYPTO 84 on Advances in cryptology
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)
Keying Hash Functions for Message Authentication

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Number-theoretic constructions of efficient pseudo-random functions

Journal of the ACM (JACM)
Dynamic and efficient key management for access hierarchies

Proceedings of the 12th ACM conference on Computer and communications security
Merging: An Efficient Solution for a Time-Bound Hierarchical Key Assignment Scheme

IEEE Transactions on Dependable and Secure Computing
A secure system for data access based on anonymous authentication and time-dependent hierarchical keys

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
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
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
Constructing key assignment schemes from chain partitions

DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy
Provably secure key assignment schemes from factoring

ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Provably-Secure Time-Bound Hierarchical Key Assignment Schemes

Journal of Cryptology
Efficient provably-secure hierarchical key assignment schemes

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hierarchical Key Assignment Schemes can be used to enforce access control policies by cryptographic means. In this paper, we present a new, enhanced security model for such schemes. We also give simple, efficient, and strongly-secure constructions for Hierarchical Key Assignment Schemes for arbitrary hierarchies using pseudorandom functions and forward-secure pseudorandom generators. We compare instantiations of our constructions with state-of-the-art Hierarchical Key Assignment Schemes, demonstrating that our new schemes possess an attractive trade-off between storage requirements and efficiency of key derivation.