Abstract
Message authentication is the most effective way to protect the data from unauthorized access and corrupted messages being forwarded in wireless sensor networks (WSNs). For this reason, many message authentication schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems. Some have the limitations of high computational and communication overhead and lack of scalability to node compromise attacks. To address these issues, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial. While enabling intermediate nodes authentication, the proposed scheme allows any node to transmit an unlimited number of messages without suffering the threshold problem. In addition VGuard Security framework is used provide source privacy in the network. Both theoretical analysis and simulation results demonstrate that our proposed scheme is more efficient than the polynomial-based approach in terms of computational and communication overhead for various comparable security levels while providing message source privacy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ye, F., Lou, H., Lu, S., Zhang, L.: Statistical en-route filtering of injected false data in sensor networks. In: IEEE INFOCOM (March 2004)
Li, J., Li, Y., Ren, J., Wu, J.: Hop-by-Hop Message Authentication and Source Privacy in Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems
Zhu, S., Setia, S., Jajodia, S., Ning, P.: An interleaved hop-by-hop authentication scheme for filtering false data in sensor networks. In: IEEE Symposium on Security and Privacy (2004)
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-secure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)
Zhang, W., Subramanian, N., Wang, G.: Lightweight and compromiseresilient message authentication in sensor networks. In: IEEE INFOCOM, Phoenix, AZ, April 15-17 (2008)
Albrecht, M., Gentry, C., Halevi, S., Katz, J.: Attacking cryptographicschemes based on ”perturbation polynomials”. Cryptology ePrintArchive, Report 2009/098 (2009), http://eprint.iacr.org/
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digitalsignatures and public-key cryptosystems. Communications. of the Assoc.of Comp. Mach. 21(2), 120–126 (1978)
ElGamal, T.A.: A public-key cryptosystem and a signature schemebased on discrete logarithms. IEEE Transactions on Information Theory 31(4), 469–472 (1985)
Wang, H., Sheng, S., Tan, C., Li, Q.: Comparing symmetric-key andpublic-key based security schemes in sensor networks: A case study ofuser access control. In: IEEE ICDCS, Beijing, China, pp. 11–18 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Anil Kumar, B., Bhaskara Rao, N., Sunitha, M.S. (2015). Authentication of the Message through Hop-by-Hop and Secure the Source Nodes in Wireless Sensor Networks. In: Satapathy, S., Biswal, B., Udgata, S., Mandal, J. (eds) Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014. Advances in Intelligent Systems and Computing, vol 328. Springer, Cham. https://doi.org/10.1007/978-3-319-12012-6_87
Download citation
DOI: https://doi.org/10.1007/978-3-319-12012-6_87
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12011-9
Online ISBN: 978-3-319-12012-6
eBook Packages: EngineeringEngineering (R0)