Communication Cost Optimized Session Key Transmission Scheme for WSN Based on Non-Perfect Secret Sharing

Abstract:

With the extensively applying of Wireless Sensor Networks (WSN), its' security drew more and more attention. In all the security issues in WSN, session key is fundamental one with great challenge. Due to the constraints of limited hardware resources and computational capabilities, use asymmetric encryption mechanisms in session key are not suitable for WSN. And there are usually a puzzle for existing symmetric encryption mechanisms that they produced heavy communication cost. In this paper, we presented a session key transmission scheme based on an algorithm of Data Partitioning with Coding, named DPC. By using of non-perfect secret sharing, we optimized the communication costs significantly and keep the security in high level. The analysis and simulations prove that our scheme has good performance.

• Periodical: Applied Mechanics and Materials (Volumes 631-632)
• Pages: 882-888
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.631-632.882
• Online since: September 2014
• Authors: Zong Xiao Lan*, Ge Ming Xia, Ao Long Zhou
• Keywords: Communication Cost, Key Transmission, Secret Sharing, Wireless Sensor Network (WSN)

References

[1] F. Yavuz, J. Zhao, O. Yagan, and V. Gligor, On secure and reliable communications in wireless sensor networks: Towards k-connectivity under a random pairwise key predistribution scheme, in Proc. of IEEE International Symposium on Information Theory (ISIT), (2014).

DOI: 10.1109/isit.2014.6875260

[2] D. W. Carman, P. S. Kruus, and B. J. Matt, Constraints and approaches for distributed sensor network security, NAI Labs Technical Report, vol. 00, no. 010, (2002).

[3] D. Liu, P. Ning, and R. Li, Establishing pairwise keys in distributed sensor networks, ACM Transactions on Information and System Security (TISSEC), vol. 8, no. 1, p.41–77, (2005).

DOI: 10.1145/1053283.1053287

[4] S. Zhu, S. Setia, and S. Jajodia, Leap: Efficient security mechanisms for large-scale distributed sensor networks, ACM Transactions on Sensor Networks (TOSN), vol. 2, no. 4, p.500–528, (2006).

DOI: 10.1145/1218556.1218559

[5] W. Zhang and G. Cao, Group rekeying for filtering false data in sensor networks: A predistribution and local collaboration-based approach, in INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 1. IEEE, 2005, p.503.

DOI: 10.1109/infcom.2005.1497918

[6] H. Chan, A. Perrig, and D. Song, Random key predistribution schemes for sensor networks, in Security and Privacy, 2003. Proceedings. 2003 Symposium on. IEEE, 2003, p.197–213.

[7] S. Zhu, S. Xu, S. Setia, and S. Jajodia, Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach, in Network Protocols, 2003. Proceedings. 11th IEEE International Conference on. IEEE, 2003, p.326–335.

DOI: 10.1109/icnp.2003.1249782

[8] A. Shamir, How to share a secret, Communications of the ACM, vol. 22, no. 11, p.612–613, (1979).

DOI: 10.1145/359168.359176

[9] G. Blakley, Safeguarding cryptographic keys, in Proceedings of the 1979 AFIPS National Computer Conference. Monval, NJ, USA: AFIPS Press, 1979, p.313–317.

[10] T. Claveirole, M. Dias de Amorim, M. Abdalla, and Y. Viniotis, Securing wireless sensor networks against aggregator compromises, Communications Magazine, IEEE, vol. 46, no. 4, p.134–141, (2008).

DOI: 10.1109/mcom.2008.4481352

[11] J. Kurihara, S. Kiyomoto, K. Fukushima, and T. Tanaka, On a fast (k, n, k)-threshold secret sharing scheme, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. 91, no. 9, p.2365–2378, (2008).

DOI: 10.1093/ietfec/e91-a.9.2365

[12] Y. Nagai, H. Kang, and K. Iwamura, A key management system with a storage-saving secret sharing scheme in a sensor network, in The International Conference on Electrical and Electronics Engineering, Clean Energy and Green Computing (EEECEGC2013). The Society of Digital Information and Wireless Communication, 2013, p.35.

DOI: 10.1109/gcce.2013.6664913

[13] O. Farràs, T. Hansen, T. Kaced, and C. Padró, Optimal non-perfect uniform secret sharing schemes., IACR Cryptology ePrint Archive, vol. 2014, p.124, (2014).

DOI: 10.1007/978-3-662-44381-1_13