Paper 2006/483

New Constructions for Provably-Secure Time-Bound Hierarchical Key Assignment Schemes

Alfredo De Santis, Anna Lisa Ferrara, and Barbara Masucci


A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each class in the hierarchy can compute the keys of all classes lower down in the hierarchy, according to temporal constraints. In this paper we propose new constructions for time-bound hierarchical key assignment schemes which are provably secure with respect to key indistinguishability. Our constructions use as a building block any provably-secure hierarchical key assignment scheme without temporal constraints and exhibit a tradeoff among the amount of private information held by each class, the amount of public data, the complexity of key derivation, and the computational assumption on which their security is based. Moreover, the proposed schemes support updates to the access hierarchy with local changes to the public information and without requiring any private information to be re-distributed.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Access controlkey assignmentprovable securityefficient key derivation.
Contact author(s)
masucci @ dia unisa it
2007-01-03: revised
2006-12-29: received
See all versions
Short URL
Creative Commons Attribution


      author = {Alfredo De Santis and Anna Lisa Ferrara and Barbara Masucci},
      title = {New Constructions for Provably-Secure Time-Bound Hierarchical Key Assignment Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2006/483},
      year = {2006},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.