A hierarchical key assignment scheme is a method to assign some private information and encryption keys to a set of classes in a partially ordered hierarchy, in such a way that the private information of a higher class can be used to derive the keys of all classes lower down in the hierarchy. In this paper we design and analyze hierarchical key assignment schemes which are provably secure and support dynamic updates to the hierarchy with local changes to the public information and without requiring any private information to be re-distributed. We first consider the problem of constructing a hierarchical key assignment scheme by using as a building block a symmetric encryption scheme. We propose a new construction which is provably secure with respect to key indistinguishability, requires a single computational assumption, and improves on previous proposals. Then, we show how to construct a hierarchical key assignment scheme by using as a building block a public-key broadcast encryption scheme. In particular, one of our constructions provides constant private information and public information linear in the number of classes in the hierarchy. (C) 2011 Elsevier B.V. All rights reserved.
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.tcs.2011.06.024|
|Codice identificativo ISI:||WOS:000295498100005|
|Codice identificativo Scopus:||2-s2.0-80052271043|
|Titolo:||Efficient provably-secure hierarchical key assignment schemes|
|Appare nelle tipologie:||1.1 Articolo in rivista|