The week's pick
Reseach Article
LOKS: Low-Overhead Forward and Backward Key Secrecy in WSNs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 127 - Number 1 |
| Year of Publication: 2015 |
| Authors: Malvika Ashok, Rohit Vaid |
10.5120/ijca2015906317
|
Malvika Ashok, Rohit Vaid . LOKS: Low-Overhead Forward and Backward Key Secrecy in WSNs. International Journal of Computer Applications. 127, 1 ( October 2015), 36-41. DOI=10.5120/ijca2015906317
Abstract
Security plays an important role in designing a wireless sensor networks (WSNs). As the medium is wireless in nature which is more vulnerable to adversaries attacks in the network. Key management is used to achieve security in WSNs. If symmetric key is used in the network then one key is more enough to secure the network but the issue is that once the key is compromised, entire network gets compromised. On the other hand, if an individual key is provided to every sensor in the network then sensor to sensor communication is not possible in the network. Therefore sensors are grouped together to form a cluster. Each cluster is assigns a cluster key shared by every cluster member of the group. If this key is fixed then key compromising affects the security principle in the entire group. So to avoid this type of attack, key is updated after a fix interval of time. But if key updating is done by the base station, communication overheads in updating the keys are increased in the network. Therefore resource constrained wireless sensor networks; the concept of key generation is used instead of key distribution. In key generation process, the key is generated by applying a one way hash function on a given secret. But the problem is that if this secret is compromised, all the keys which are generated in past or to be generated in the future are immediately compromised. In this research paper, we present a LOKS: Low-Overhead Forward and Backward Key Secrecy scheme to secure WSNs. This scheme updates the keys of each cluster in the network with resiliency to attack. Simulation results proves that presented scheme takes less number of communication overheads as compared to existing schemes given in literature to update the group keys for every groups after every round.
References
- Ali Bagherinia, Akbar Bemana, Sohrab Hojjatkhah and Ali Jouharpourr, “A Key Management Approach for Wireless Sensor Networks,” IJITMC, pp. 1-9, 2014.
- Baojiang Cui, Ziyue Wang, Bing Zhao, Xiaobing Liang and Yuemin Ding, “Enhanced Key Management Protocols for Wireless Sensor Networks,” pp. 1-10, September 2014
- Hani Alzaid, DongGook Park, Juan Gonzalez Nieto, Colin Boyd and Ernest Foo, “A Forward & Backward Secure Key Management in Wireless Sensor Networks for PCS/SCADA,” Volume 24, , pp 66-82, 2010.
- Roberto Di Pietro , Luigi V. Mancini and Sushil Jajodia, “Providing secrecy in key management protocols for large wireless sensors networks,” Elsevier, Vol. 1, pp. 455-468, November 2003.
- Vinayak Naik, Anish Arora, Sandeep Bapat and Mohamed Gouda, “Whisper: Local Secret Maintenance in Sensor Networks,” pp. 1-16, 2003.
- Reza Azarderskhsh and Arash Reyhani-Masoleh, “ Secure Clustering and Symmetric Key Establishment in HeterogeneousWireless Sensor Networks,” Hindawi Publishing Corporation EURASIP Journal onWireless Communications and Networking, pp. 1-12, 2 October, 2010.
- Wensheng Zhang , Minh Tran, Sencun Zhu and Guohong Cao, “A Random Perturbation-Based Scheme for Pairwise Key Establishment in Sensor Networks,” ACM 978-1-59593-684, pp. 1-10, Sept 2007.
- Eric Ke Wang, Lucas C.K HUI and S.M. Yiu, “A New Key Establishment Scheme for Wireless Sensor Networks,” International Journal of Network Security and its Applications(IJNSA), Vol. 1, No. 2, pp. 17- 27, July 2009.
- Wenliang Du, Jing Deng, Yunghsiang S.Han, Pramod K. Varshney, Jonathan Katz and Aram Khalili, “A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks,” ACM Journal Name, Vol.4, pp. 1-29, September 9, 2010.
- Mu Kun and Li Li, “ An Efficient Pairwise Key Predistribution Scheme for Wireless Sensor Networks,” JOURNAL OF NETWORKS, Vol. 9, No. 2, pp. 1-6, February 2014.
- Donggang Liu, Peng Ning, “Establishing Pairwise Keys in Distributed Sensor Networks,” ACM 158113738, 2003.
- Seyit Ahmet Camtepe, Bulent Yener, Moti Yung, “Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks,” IEEE International Conference, pp. 1-6, 2006.
- Wenliang Du, Jing Deng, Pramod K. Varshney, et al., “A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks,” ACM Journal Name, Vol. V, pp. 228-258, 2 May 2005.
- Chi Yuan Chen and Han Chieh Chao, “A survey of key distribution in wireless sensor networks,” Wiley Online Library, pp. 1-14, 2011.
- Rohit Vaid and Vijay Kumar, “Security issues and Remedies in Wireless Sensor Networks- A Survey,” International Journal of Computer Applications, Vol. 79, No. 4, October 2013.
- Saurabh Singh, Dr. Harsh Kumar Verma, “Security for Wireless Sensor Network,” International Journal for Computer Science and Engineering (IJCSE), Vol. 3, No. 6, pp. 1-7, 2011.
Index Terms
Keywords