New constructions for provably-secure time-bound hierarchical key assignment schemes

详细信息    查看全文

• 作者：Alfredo De Santis ; Anna Lisa Ferrara ; Barbara Masucci
• 关键词：Access control ; Key assignment ; Provable security ; Efficient key derivation
• 刊名：Theoretical Computer Science
• 出版年：2008
• 出版时间：6 November 2008
• 年：2008
• 卷：407
• 期：1-3
• 页码：213-230
• 全文大小：1600 K

文摘

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 public information and without requiring any private information to be re-distributed.