Hierarchical and Shared Key Assignment
Authors:
- Arcangelo CastiglioneArcangelo Castiglione
- Alfredo De SantisASAlfredo De Santis
- Barbara MasucciBMBarbara Masucci
- 1 September 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4708 (21570418) , 263-270
Abstract
Access control ensures that only the authorized users of a system are allowed to access certain resources or tasks. Usually, according to their powers and responsibilities, users are organized in hierarchies formed by a certain number of disjoint classes. Such hierarchies are implemented by assigning a key to each class, so that the keys for descendant classes can be derived efficiently from classes higher in the hierarchy. However, in many cases the only hierarchical access represents a limitation. Indeed, sometimes it might be useful or even necessary to ensure the access to a resource or task to both his direct responsible (or owner) and a group of users possessing certain credentials. In this paper, we first propose a novel model that extends the conventional hierarchical access and allows such access even by certain sets of qualified users. Afterwards, we propose a construction for hierarchical key assignment schemes in this new model. The proposed construction is provably secure with respect to key indistinguishability and relies on both symmetric encryption and perfect secret sharing.Keywords
This publication has 20 references indexed in Scilit:
- Efficient provably-secure hierarchical key assignment schemesTheoretical Computer Science, 2011
- Variations on a theme by Akl and Taylor: Security and tradeoffsTheoretical Computer Science, 2010
- Security and Tradeoffs of the Akl-Taylor Scheme and Its VariantsLecture Notes in Computer Science, 2009
- Dynamic and Efficient Key Management for Access HierarchiesACM Transactions on Information and System Security, 2009
- New constructions for provably-secure time-bound hierarchical key assignment schemesTheoretical Computer Science, 2008
- Number-theoretic constructions of efficient pseudo-random functionsJournal of the ACM, 2004
- A concrete security treatment of symmetric encryption2002
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- How to construct random functionsJournal of the ACM, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984