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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akl, S., Taylor, P.: Cryptographic solution to a problem of access control in a hierarchy. J-TOCS 1(3), 239–248 (1983)
Sandhu, R.: Cryptographic implementation of a tree hierarchy for access control. Information Processing Letters 27(2), 95–98 (1988)
Harn, L., Lin, H.: Cryptographic key generation scheme for multilevel data security. Computers and Security 9(6), 539–546 (1990)
Shen, V.R.L., Chen, T.S.: A novel key management scheme based on discrete logarithms and polynomial interpolations. Computers and Security 21(2), 164–171 (2002)
Wu, J., Wei, R.: An access control scheme for partial ordered set hierarchy with provable security. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 221–232. Springer, Heidelberg (2006)
Yang, C., Li, C.: Access control in a hierarchy using one-way hash functions. Computers and Security 23(8), 659–664 (2004)
Atallah, M., Frikken, K., Blanton, M.: Dynamic and efficient key management for access hierarchies. In: ACM Conference on Computer and Communications Security (CCS 2005), pp. 190–202 (2005)
Hsu, C.L., Wu, T.S.: Cryptanalyses and improvements of two cryptographic key assignment schemes for dynamic access control in a user hierarchy. Computers and Security 22(5), 453–456 (2003)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vadnala, P.K., Mathuria, A. (2006). An Efficient Key Assignment Scheme for Access Control in a Hierarchy. In: Bagchi, A., Atluri, V. (eds) Information Systems Security. ICISS 2006. Lecture Notes in Computer Science, vol 4332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11961635_14
Download citation
DOI: https://doi.org/10.1007/11961635_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68962-1
Online ISBN: 978-3-540-68963-8
eBook Packages: Computer ScienceComputer Science (R0)