Anti-collusive self-healing key distributions for wireless networks Online publication date: Fri, 31-Oct-2014
by Ratna Dutta
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 7, No. 4, 2014
Abstract: We introduce three efficient anti-collusive self-healing key distribution schemes with t-revocation capability. Our proposed key distribution mechanism uses one-way hash chain. We obtain reduced storage, communication and computation costs over the previous approaches, which make our designs scalable to very large groups in highly mobile, volatile and hostile wireless networks. Our schemes are properly analysed in an appropriate security model and are proven to be computationally secure and achieve both forward and backward secrecy. Also our schemes can resist collusion between the newly joint users and the revoked users. Our set-up allows each user to choose its joining session at its will, whereas the session for user's revocation is pre-selected by the group manager. Unlike the existing self-healing key distribution schemes, rejoining of revoked users is permitted in our schemes at a later session with new identities. These features facilitate the group manager no longer to execute expensive traitor tracing mechanisms to keep track of individual compromised users.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook