Accomplished Self-Curative Key Dispersion in Mobile Ad-hoc Networks

Abstract: This Paper is to extract the underlying concepts Self-CURATIVE key DISPERSION schemes are particularly useful when there is no network infrastructure or such infrastructure has been destroyed. A self-CURATIVE mechanism can allow group users to recover lost session keys and is therefore quite suitable for establishing group keys over an unreliable network, especially for infrastructure less wireless networks, where broadcast messages loss may occur frequently In this project, we will propose an ACCOMPLISHED self-CURATIVE key DISPERSION scheme with sponsorization capability. The main contribution of this project is highlighted by the following properties: The distance between two broadcasts which are used to recover the lost one can be set according to the underlying wireless networks. Working in this way facilitates a shorter length of the broadcast messages. More users of the group can sponsor a new user to join the group for subsequent sessions without any interaction with the group manager. The storage overhead of personal keys at each group user is a polynomial, which will not increase with the number of sessions. This project presents an analysis of security and efficiency. Findings performed here suggest that the proposed scheme outperforms other self-CURATIVE key DISPERSION schemes in term of the length of broadcasts, sponsorization, and storage overhead.This proposed project is implemented using the Java Microedition package which has the ability to code for the mobile devices. We also use the Sun java wireless toolkit to simulate the running of the project before deploying in the real world environment.

Keywords: Cryptography, concept factorization, WN : Wireless Network, HC: Hash Chain,QC: Quantum Cryptography, GM : Group Manager, K : Key,UML: Unified Modelling Language, J2ME: Java Micro Edition, key-agreement protocol.