An Efficient Key Assignment Scheme for Access Control in a Hierarchy

  • Praveen Kumar Vadnala
  • Anish Mathuria
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4332)


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.


Access Control Root Node Hash Function Central Authority Discrete Logarithm Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akl, S., Taylor, P.: Cryptographic solution to a problem of access control in a hierarchy. J-TOCS 1(3), 239–248 (1983)CrossRefGoogle Scholar
  2. 2.
    Sandhu, R.: Cryptographic implementation of a tree hierarchy for access control. Information Processing Letters 27(2), 95–98 (1988)CrossRefGoogle Scholar
  3. 3.
    Harn, L., Lin, H.: Cryptographic key generation scheme for multilevel data security. Computers and Security 9(6), 539–546 (1990)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Yang, C., Li, C.: Access control in a hierarchy using one-way hash functions. Computers and Security 23(8), 659–664 (2004)zbMATHCrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Praveen Kumar Vadnala
    • 1
  • Anish Mathuria
    • 1
  1. 1.Dhirubhai Ambani Institute of Information and Communication TechnologyGujaratIndia

Personalised recommendations