Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes

Eduarda S.  V.  Freire; Kenneth G.  Paterson; Bertram Poettering

Paper 2012/645

Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes

Eduarda S. V. Freire, Kenneth G. Paterson, and Bertram Poettering

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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. This is the full version of the corresponding paper on CT-RSA 2013
Keywords: efficient key assignment arbitrary hierarchies provable security
Contact author(s): bertram poettering @ rhul ac uk
History: 2013-03-22: revised; 2012-11-20: received; See all versions
Short URL: https://ia.cr/2012/645
License: CC BY

BibTeX

@misc{cryptoeprint:2012/645,
      author = {Eduarda S.  V.  Freire and Kenneth G.  Paterson and Bertram Poettering},
      title = {Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2012/645},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/645}},
      url = {https://eprint.iacr.org/2012/645}
}