An efficient key assignment scheme for access control in a hierarchy

Authors:
Praveen Kumar Vadnala;Anish Mathuria
Affiliations:
Dhirubhai Ambani Institute of Information and Communication Technology, Gujarat, India;Dhirubhai Ambani Institute of Information and Communication Technology, Gujarat, India
Venue:
ICISS'06 Proceedings of the Second international conference on Information Systems Security
Year:
2006

Citing 6
Cited 1

Cryptographic implementation of a tree hierarchy for access control

Information Processing Letters
A cryptographic key generation scheme for multilevel data security

Computers and Security
Cryptographic solution to a problem of access control in a hierarchy

ACM Transactions on Computer Systems (TOCS)
Introduction to Algorithms

Introduction to Algorithms
Dynamic and efficient key management for access hierarchies

Proceedings of the 12th ACM conference on Computer and communications security
An access control scheme for partially ordered set hierarchy with provable security

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography

Improving security and efficiency of time-bound access to outsourced data

Proceedings of the 6th ACM India Computing Convention

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines a hash based hierarchical access control scheme proposed by Yang and Li. It is shown that the scheme suffers from the ex-member access problem. A new hash based scheme that avoids the ex-member problem is proposed. Our scheme has the following advantages: (i) it uses less private storage per node; (ii) addition or deletion of nodes and users does not require rekeying of all nodes; and (iii) the static version of the scheme carries a proof of security. A hash based scheme recently proposed by Atallah, Frikken and Blanton also has these properties. Compared to their scheme, our scheme requires less public storage space for tree hierarchies.