CFP last date
20 May 2024
Reseach Article

Group Key Exchange Management in Delay Tolerant Network

by Muktesh Gupta
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 144 - Number 3
Year of Publication: 2016
Authors: Muktesh Gupta
10.5120/ijca2016910165

Muktesh Gupta . Group Key Exchange Management in Delay Tolerant Network. International Journal of Computer Applications. 144, 3 ( Jun 2016), 16-19. DOI=10.5120/ijca2016910165

@article{ 10.5120/ijca2016910165,
author = { Muktesh Gupta },
title = { Group Key Exchange Management in Delay Tolerant Network },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2016 },
volume = { 144 },
number = { 3 },
month = { Jun },
year = { 2016 },
issn = { 0975-8887 },
pages = { 16-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume144/number3/25159-2016910165/ },
doi = { 10.5120/ijca2016910165 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:47:32.502407+05:30
%A Muktesh Gupta
%T Group Key Exchange Management in Delay Tolerant Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 144
%N 3
%P 16-19
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Existing group key management scheme may not be applied effectively in Delay tolerant network where transmission between nodes (users) has the characteristics of irregular connectivity and long communication delay. In Previous proposed schemes, Group key is regenerated every time whenever new user joins or leave form the existing group, in order to maintain backward secrecy and forward secrecy and therefore the overhead to broadcast new group key to all member of group increases. In this proposed scheme which is based on Chinese remainder theorem constraint to broadcast new group key generated by server in case of user join as well as user leave is removed thus making the complexity constant in both scenario. Simulation is done in Opportunistic Networking Environment(ONE) Simulator and the result shows that Key update , Receiving success rate and key update success rate is better than Logical key Hierarchy LKH as well as Chinese remainder group key (CRGK) schemes.

References
  1. R. S. Mangrulkar "Design and Development of Delay Tolerant Network : A Case Study" Nirma University International Conference on Engineering (NUiCONE) IEEE 2012
  2. Harminder Singh Bindra, Amrit Lal Sangal "Considerations and Open Issues in Delay Tolerant Network’S (DTNs) Security" Scientific Research August 2010
  3. Sofia Anna Menesidou and Vasilios Katos "Authenticated Key Exchange (AKE) in Delay Tolerant Networks" Springer Berlin Heidelberg 2012
  4. H. Harney, C. Muckenhirn Group Key Management Protocol (GKMP) Architecture RFC 2094, IETF Network Working Group, July 1997..
  5. Muhammad Yasir Malik "Efficient Group Key Management Schemes for Multicast Dynamic Communication Systems" 2012
  6. H. Harney and E. Harder, “Logical key hierarchy protocol,” draft-harney-sparta-lkhpsec00.txt, IETF Internet Draft, 1999.
  7. Guoyu Xu, Xingyuan Chen, Xuehui Du, Zhengzhou "Chinese Remainder Theorem Based DTN Group Key Management" IEEE January 2012
  8. Yuke Wang "New Chinese Remainder Theorems" IEEE 1998
  9. Xinliang Zheng,Chin-tser Huang "Chinese Remainder Theorem Based Group Key Management"citeseer 2007
  10. Ari Keränen, Jörg Ott, Teemu Kärkkäinen "The ONE Simulator for DTN Protocol Evaluation" ICST 2009
  11. .
Index Terms

Computer Science
Information Sciences

Keywords

Delay tolerant network Group key management Chinese Remainder Theorem Logical Key Hierarchy Opportunistic Networking Environment Modified Chinese reminder group key.