A note on time-bound hierarchical key assignment schemes

Authors:
Giuseppe Ateniese;Alfredo De Santis;Anna Lisa Ferrara;Barbara Masucci
Affiliations:
The Johns Hopkins University, Baltimore, MD 21218, USA;Universití di Salerno, 84084 Fisciano (SA), Italy;Bristol University, Bristol, BS8 1UB, UK;Universití di Salerno, 84084 Fisciano (SA), Italy
Venue:
Information Processing Letters
Year:
2013

Citing 12
Cited 0

A temporal key management scheme for secure broadcasting of XML documents

Proceedings of the 9th ACM conference on Computer and communications security
A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy

IEEE Transactions on Knowledge and Data Engineering
Efficient Time-Bound Hierarchical Key Assignment Scheme

IEEE Transactions on Knowledge and Data Engineering
Security of Chien's Efficient Time-Bound Hierarchical Key Assignment Scheme

IEEE Transactions on Knowledge and Data Engineering
An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription

Proceedings of the 14th ACM international conference on Information and knowledge management
A secure system for data access based on anonymous authentication and time-dependent hierarchical keys

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Provably-secure time-bound hierarchical key assignment schemes

Proceedings of the 13th ACM conference on Computer and communications security
New constructions for provably-secure time-bound hierarchical key assignment schemes

Theoretical Computer Science
Unconditionally secure key assignment schemes

Discrete Applied Mathematics - Special issue: Coding and cryptography
Provably-Secure Time-Bound Hierarchical Key Assignment Schemes

Journal of Cryptology
Enforcing the security of a time-bound hierarchical key assignment scheme

Information Sciences: an International Journal
Incorporating temporal capabilities in existing key management schemes

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 can compute the keys of all classes lower down in the hierarchy, according to temporal constraints. In this paper we consider the unconditionally secure setting for time-bound hierarchical key assignment schemes and distinguish between two different goals: security with respect to key indistinguishability and against key recovery. We first present definitions of security with respect to both goals; then, we prove a tight lower bound on the size of the private information distributed to each class; finally, we show an optimal construction for time-bound hierarchical key assignment schemes.