Paper 2012/645 Original: eprint.iacr.org/2012/645 ↗
Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes
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
- Preprint.
- History
- 2013-03-22: last updated
- 2012-11-20: published
- Short URL
- https://ia.cr/2012/645
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2012/645}
}