An efficient access control scheme in user hierarchy based on polynomial interpolation and hash function

  • Authors:
  • Ashok Kumar Das;Adrijit Goswami;Vanga Odelu

  • Affiliations:
  • Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, 500 032, India;Department of Mathematics, Indian Institute of Technology, Kharagpur, 721 302, India;Department of Mathematics, Rajiv Gandhi University of Knowledge Technologies, Hyderabad, 500 032, India

  • Venue:
  • International Journal of Communication Networks and Distributed Systems
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

The hierarchical cryptographic key assignment is used to assign cryptographic keys to a set of partially ordered security classes so that the user in a higher security class can derive the cryptographic secret keys of the other users in a lower security class. In this paper, we propose a practical solution for dynamic access problems in a user hierarchy, which uses the polynomial interpolation and hash function. When compared with other related recent existing access control schemes, in our scheme the computational complexity and the required storage space are significantly reduced. In addition, our scheme provides provable security. Furthermore, our scheme is easy to implement and therefore, it is more suitable for practical applications.