Skip to main content

Dynamic Access Control in a Hierarchy with Constant Key Derivation Cost

  • Conference paper
  • First Online:
Progress in Intelligent Computing Techniques: Theory, Practice, and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 719))

Abstract

While providing access control in a hierarchical access structure, a partially ordered set of security classes can be used to depict an access hierarchy. Data accessible to descendants of a particular security class should also be accessible to the users of that security class. Towards this, an access control scheme is proposed for providing dynamic hierarchical access control. In the proposed solution, the storage at the users is constant. The public key storage is equal to the size of the hierarchy. Also, deriving the decryption key of a descendant class involves constant cost at the users in the security class.

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

Access this chapter

Institutional subscriptions

References

  1. Akl S.G., Taylor P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems (TOCS), vol. 1, no. 3, pp. 239–248 (1983)

    Article  Google Scholar 

  2. Chang C.C., Buehrer D.J.: Access control in a hierarchy using a one-way trap door function. Computers & Mathematics with Applications, Elsevier, vol. 26, no. 5, pp. 71–76 (1993)

    Article  MATH  Google Scholar 

  3. He M., Fan P., Kaderali F., Yuan D.: Access key distribution scheme for level-based hierarchy. Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2003), pp. 942–945 (2003)

    Google Scholar 

  4. Liaw H.T., Wang S.J., Lei C.L.: A dynamic cryptographic key assignment scheme in a tree structure. Computers & Mathematics with Applications, Elsevier, vol. 25, no. 6, pp. 109–114 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. MacKinnon S.J., Taylor P.D., Meijer H., Akl S.G.: An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Transactions on Computers, no. 9, pp. 797–802 (1985)

    Article  Google Scholar 

  6. Freire E.S.V., Paterson K.G.: Provably secure key assignment schemes from factoring. Information Security and Privacy, Springer. pp. 292–309 (2011)

    MATH  Google Scholar 

  7. Birget J.C., Zou X., Noubir G., Ramamurthy B.: Hierarchy-based access control in distributed environments. IEEE International Conference on Communications (ICC 2001), vol. 1, pp. 229–233 (2001)

    Google Scholar 

  8. Sun Y., Liu K.J.: Scalable hierarchical access control in secure group communications. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), vol. 2, pp. 1296–1306 (2004)

    Google Scholar 

  9. Zhang Q., Wang Y.: A centralized key management scheme for hierarchical access control. Global Telecommunications Conference (GLOBECOM’04), IEEE, vol. 4, pp. 2067–2071 (2004)

    Google Scholar 

  10. Ferrara A.L., Masucci B.: An information-theoretic approach to the access control problem. Theoretical Computer Science, Springer, pp. 342–354 (2003)

    MATH  Google Scholar 

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

    Google Scholar 

  12. Das M.L., Saxena A., Gulati V.P., Phatak D.B.: Hierarchical key management scheme using polynomial interpolation. ACM SIGOPS Operating Systems Review, vol. 39, no. 1, pp. 40–47 (2005)

    Article  Google Scholar 

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

    Article  Google Scholar 

  14. Chou J.S., Lin C.H., Lee T.Y.: A novel hierarchical key management scheme based on quadratic residues. Parallel and Distributed Processing and Applications, Springer, pp. 858–865 (2004)

    Google Scholar 

  15. Chung Y.F., Lee H.H., Lai F., Chen T.S.: Access control in user hierarchy based on elliptic curve cryptosystem. Information Sciences, Elsevier, vol. 178, no. 1, pp. 230–243 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Chuang Y.H., Hsu C.L.: A Robust Dynamic Access Control Scheme in a User Hierarchy Based on One-Way Hash Functions. Journal of Internet Technology, vol. 15, no. 2, pp. 197–201 (2014)

    Google Scholar 

  17. Wu J., Wei R.: An access control scheme for partially ordered set hierarchy with provable security. Selected Areas in Cryptography, Springer, pp. 221–232 (2005)

    MATH  Google Scholar 

  18. Lin C.H.: Hierarchical key assignment without public-key cryptography. Computers & Security, Elsevier, vol. 20, no. 7, pp. 612–619 (2001)

    Article  Google Scholar 

  19. Zhong S.: A practical key management scheme for access control in a user hierarchy. Computers & Security, Elsevier, vol. 21, no. 8, pp. 750–759 (2002)

    Article  Google Scholar 

  20. Chien H.Y., Jan J.K.: New hierarchical assignment without public key cryptography. Computers & Security, Elsevier, vol. 22, no. 6, pp. 523–526 (2003)

    Article  Google Scholar 

  21. Chen T.S., Huang J.Y.: A novel key management scheme for dynamic access control in a user hierarchy. Applied Mathematics and Computation, Elsevier, vol. 162, no. 1, pp. 339–351 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  22. Atallah M.J., Blanton M., Fazio N., Frikken K.B.: Dynamic and efficient key management for access hierarchies. ACM Transactions on Information and System Security (TISSEC), vol. 12, no. 3, pp. 18 (2009)

    Article  Google Scholar 

  23. D’Arco P., De S.A., Ferrara A.L., Masucci B.: Variations on a theme by Akl and Taylor: Security and tradeoffs. Theoretical Computer Science, Elsevier, vol. 411, no. 1, pp. 213–227 (2010)

    Article  MATH  Google Scholar 

  24. De S.A., Ferrara A.L., Masucci B.: Efficient provably-secure hierarchical key assignment schemes. Theoretical Computer Science, Elsevier, vol. 412, no. 41, pp. 5684–5699 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  25. Freire E.S.V., Paterson K.G., Poettering B.: Simple, efficient and strongly KI-secure hierarchical key assignment schemes. Topics in Cryptology (CT-RSA 2013), Springer, pp. 101–114 (2013)

    Google Scholar 

Download references

Acknowledgements

This work is supported by Ministry of Human Resource Development, Government of India.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nishat Koti .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Koti, N., Purushothama, B.R. (2018). Dynamic Access Control in a Hierarchy with Constant Key Derivation Cost. In: Sa, P., Sahoo, M., Murugappan, M., Wu, Y., Majhi, B. (eds) Progress in Intelligent Computing Techniques: Theory, Practice, and Applications. Advances in Intelligent Systems and Computing, vol 719. Springer, Singapore. https://doi.org/10.1007/978-981-10-3376-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3376-6_18

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3375-9

  • Online ISBN: 978-981-10-3376-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics