Abstract
In view of ad hoc open wireless channel as well as the characteristics of easy to eavesdrop, the secure network coding algorithm about non-eavesdropping is presented. The algorithm based on random network coding, using the character of one-way trapdoor function, achieves the function of non-eavesdropping by passing the value of a one-way trapdoor function, which attackers do not have and cannot get the original information. In view of pollution attack of network coding in use, a kind of pollution prevention algorithm is put forward, which makes use of the fact that the linear combination of message is still in the message space, in the source node encrypts orthogonal vectors, and in destination checks whether dot product between coding vector and orthogonal vector received is zero to check pollution. The algorithm is simple and does not limit the number of hacking channel and use the secret channel.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Cai, N., Yueng, W.R.: On the optimality of a construction of a secure network codes. In: proceedings of 2008 IEEE International SymPosium on Information Theory, Toronto, Canada, (PP. 116–170), July 2008
Harada, K., Yamamoto, H.: Strongly secure linear network coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91(10), 2720–2728 (2008)
Zhang, Y. The Research of An Advanced Secure Network Coding, China Academic Journal Electronic Publishing House. All rights reserved. http://www.cnki.net
Ho, T., Leong, B., Koetter, R., et al. Byzantine modification detection in multicast networks using randomized network coding. In: proceedings of 2004 IEEE International Symposium on Information Theory, Chicago, Illinois, June 2004
Czap, L., Vajda, I.: Detection and recovery from pollution attacks in coding based distributed storage schemes. IEEE Trans Dependable and Secure Comput. 6, 824–838 (2011)
Vileia, J.P., Lima, L., Barros, J. Light weight security for network coding. Proceedings of the IEEE International Conference on Communications (ICC), pp. 1750–1754, IEEE Press, Beijing (2008)
Jaggi, S., Langberg, M., Ho, T., et al. Correction of adversarial errors in networks. IEEE International Symposium on Information Theory, pp. 1455–1459. Adelaide, Australia (2005)
Ngai, C.K., Yang, S. Deterministic secure error-correcting (SEC) network codes. IEEE Information Theory Workshop, pp. 96–101. (2007)
Jain, K.: Security based on network topology against the wire tapping attack. IEEE Wireless Commun. 11(1), 68–71 (2004)
Siavoshani, M.J., Fragouli, C.:Onlocating byzantine attackers. In: 4th Workshop on Network Coding, Theory and Applications, pp. 1–6. (2008)
Acknowledgments
The National Natural Science Foundation of China (61151002, 60939002); The Fundamental Research Funds for the Central Universities (N110404033).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Liu, J., Wang, F.F., Li, Sh., Li, Sl. (2014). Ad hoc Eavesdropping Algorithm-Based Network Coding. In: Patnaik, S., Li, X. (eds) Proceedings of International Conference on Computer Science and Information Technology. Advances in Intelligent Systems and Computing, vol 255. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1759-6_19
Download citation
DOI: https://doi.org/10.1007/978-81-322-1759-6_19
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1758-9
Online ISBN: 978-81-322-1759-6
eBook Packages: EngineeringEngineering (R0)