Security in Mobile Wireless Network with Less Storage Overhead
Main Article Content
Abstract
Most of the recent trends in the robust security implementation attract the researcher towards the group communication using session key. How to distribute a group session key securely in the unreliable wireless network is the most challenging task for researcher. Due to the unreliable broadcast nature of the mobile wireless network packet loss scenario occurs frequently. Furthermore wireless mobile nodes are battery operated hence we have to be careful to battery life time. To acquire robust security symmetric and asymmetric key algorithms are there. Asymmetric algorithms are more secure compare with the symmetric algorithms but asymmetric algorithms are more complex and it requires large storage. The proposed research work is based on group theory, namely bilinear pairing on the Elliptic Curve point. The proposed work uses the concepts of asymmetric key for securely exchange key value with less storage overhead.
Article Details
Upon receipt of accepted manuscripts, authors will be invited to complete a copyright license to publish the paper. At least the corresponding author must send the copyright form signed for publication. It is a condition of publication that authors grant an exclusive licence to the the INFOCOMP Journal of Computer Science. This ensures that requests from third parties to reproduce articles are handled efficiently and consistently and will also allow the article to be as widely disseminated as possible. In assigning the copyright license, authors may use their own material in other publications and ensure that the INFOCOMP Journal of Computer Science is acknowledged as the original publication place.