An efficient access control scheme in user hierarchy based on polynomial interpolation and hash function
by Ashok Kumar Das; Adrijit Goswami; Vanga Odelu
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 12, No. 2, 2014

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.

Online publication date: Sat, 21-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com