Skip to main content

Efficient Hierarchical Key Management Scheme Based on Polynomial Construction

  • Conference paper
Security in Computing and Communications (SSCC 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 377))

Included in the following conference series:

  • 1228 Accesses

Abstract

In this paper, we propose a hierarchical key management scheme based on polynomial interpolation technique. We review the existing hierarchical key management schemes based on polynomial interpolation technique for public space, private space, key derivation cost and forward/backward security requirements. The proposed scheme has several features. Only one key is stored by the user of any security class. The key derivation process requires only one polynomial evaluation and hash computations. We compare the proposed scheme with the schemes based on polynomial interpolation and show that our scheme is efficient. Our proposed scheme satisfies backward secrecy and forward secrecy requirements upon new class addition and existing class deletion respectively. Only one polynomial construction is required for rekeying during new class addition and existing class deletion. The proposed scheme is secure against common subordinate and collaborative attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)

    Google Scholar 

  2. Chang, C.-C., Hwang, R.-J., Wu, T.-C.: Cryptographic key assignment scheme for access control in a hierarchy. Information Systems 17(3), 243–247 (1992)

    Article  Google Scholar 

  3. Chang, C.-C., Lin, I.-C., Tsai, H.-M., Wang, H.-H.: A key assignment scheme for controlling access in partially ordered user hierarchies. In: International Conference on Advanced Information Networking and Applications (AINA), pp. 376–379 (2004)

    Google Scholar 

  4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3 edn. MIT Press (2009)

    Google Scholar 

  5. Das, M.L., Saxena, A., Gulati, V.P., Phatak, D.B.: Hierarchical key management scheme using polynomial interpolation. SIGOPS Oper. Syst. Rev. 39(1), 40–47 (2005)

    Article  Google Scholar 

  6. Denning, D., Akl, S., Heckman, M., Lunt, T., Morgenstern, M., Neumann, P., Schell, R.: Views for multilevel database security. IEEE Transactions on Software Engineering SE-13(2), 129–140 (1987)

    Article  Google Scholar 

  7. Fraim, L.: Scomp: A solution to the multilevel security problem. Computer 16(7), 26–34 (1983)

    Article  Google Scholar 

  8. Giri, D., Srivastava, P.D.: A cryptographic key assignment scheme for access control in poset ordered hierarchies with enhanced security. I. J. Network Security 7(2), 223–234 (2008)

    Google Scholar 

  9. Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press (1978)

    Google Scholar 

  10. Hsu, C.L., Wu, T.S.: Cryptanalyses and improvements of two cryptographic key assignment schemes for dynamic access control in a user hierarchy. Computers & Security 22(5), 453–456 (2003)

    Article  Google Scholar 

  11. Liaw, H.T., Wang, S.J., Lei, C.L.: A dynamic cryptographic key assignment scheme is a tree structure. Computers and Mathematics with Applications 25(6), 109–114 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lu, W.-P., Sundareshan, M.K.: A model for multilevel security in computer networks. IEEE Transaction on Software Engineering 16(6), 647–659 (1990)

    Article  Google Scholar 

  13. McHugh, J., Moore, A.P.: A security policy and formal top level specification for a multi-level secure local area network. In: IEEE Symposium on Security and Privacy 1986, pp. 34–39 (1986)

    Google Scholar 

  14. Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. Computer 29(2), 38–47 (1996)

    Article  Google Scholar 

  15. Shen, V.R.L., Chen, T.S.: A novel key management scheme based on discrete logarithms and polynomial interpolations. Computers & Security 21(2), 164–171 (2002)

    Article  Google Scholar 

  16. Tsai, H.M., Chang, C.C.: A cryptographic implementation for dynamic access control in a user hierarchy. Computers & Security 14(2), 159–166 (1995)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Purushothama, B.R., Amberker, B.B. (2013). Efficient Hierarchical Key Management Scheme Based on Polynomial Construction. In: Thampi, S.M., Atrey, P.K., Fan, CI., Perez, G.M. (eds) Security in Computing and Communications. SSCC 2013. Communications in Computer and Information Science, vol 377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40576-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40576-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40575-4

  • Online ISBN: 978-3-642-40576-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics