Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 16 June 2014

AN EFFICIENT AND VARIABLE INTERVAL REKEYING FOR DYNAMIC AD HOC MULTICAST GROUP USING KEY PATH REDUCTION

R. Pugalenthi1 & T. V. Gopal2

Journal of Computer Science, Volume 10, Issue 7, pp. 1281–1290 · doi.org/10.3844/jcssp.2014.1281.1290

6,712 accesses4,484 downloads0 citations (Crossref)Metrics
Cite Check for updates

Abstract

Key distribution is one of the major issues in secure ad hoc multicast group communication. There has been an extensive research on rekeying, to reduce cost. In this study, we propose an efficient and scalable batch rekeying for dynamic ad hoc multicast group, with variable interval and key path reduction techniques. The proposed scheme overcomes the major existing issues like inefficiency in using the keys that are generated and distributed, the sync issue in which a user tries to decrypt a data using an irrelevant key, imbalance in network traffic and latency in the key server response to the user request, for leaving and joining at once. Generally, a central key server is used to govern all the above issues. The proposed scheme excludes the usage of a central key server by generating the group key in the individual nodes, which minimizes the communication overhead and the number of keys that each user possesses. The proposed scheme also reduces the depth of the tree very effectively, when a user joins or leaves the group, using key path reduction technique and ensures forward and backward secrecy. The simulation result shows better performance when compared to individual, regular batch and periodic rekeying.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Pugalenthi, R. & Gopal, T. V. (2014). AN EFFICIENT AND VARIABLE INTERVAL REKEYING FOR DYNAMIC AD HOC MULTICAST GROUP USING KEY PATH REDUCTION. Journal of Computer Science, 10(7), 1281–1290. https://doi.org/10.3844/jcssp.2014.1281.1290

Licence
© Science Publications
Issue
Volume 10, Issue 7
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
AN EFFICIENT AND VARIABLE INTERVAL REKEYING FOR DYNAMIC AD HOC MULTICAST GROUP USING KEY PATH REDUCTIONJournal of Computer Science · Volume 10, Issue 7 · pp. 1281–1290 · © Science PublicationsDownload