Abstract
Network coding provides a new data transmission paradigm for network protocols. However, the packets-mixture nature makes network coding systems notoriously susceptible to pollution attacks. Previous security solutions will incur high computation and transmission overhead, and they will be worse when facing malicious collusion attacks. In this paper, we propose an efficient authentication scheme, which allows participating nodes to efficiently detect corrupted packets based on orthogonality and timeliness. Our work is the first orthogonality and timeliness based solution to frustrate pollution attacks with arbitrary collusion. The security analysis shows that polluted packets can pass our authentication scheme with a very low probability. We also present simulations of our scheme, and results demonstrate the practicality and efficiency of our scheme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahlswede R, Cai N, Li S-Y, Yeung R (2000) Network information flow. IEEE Trans Inf Theory 46:1204–1216
Chung K-C, Chen H-C, Liao W (2011) Congestion-aware network-coding-based opportunistic routing in wireless Ad Hoc networks. In: IEEE global telecommunications conference (GLOBECOM 2011), pp 1–5
Hnin Yu S, Adachi F (2011) Power efficient adaptive network coding in wireless sensor networks. In: IEEE international conference on communications pp 1–5
Silva D, Kschischang FR (2009) Universal weakly secure network coding. In: IEEE information theory workshop on networking and information theory, pp 281–285
Koetter R, Kschischang FR (2009) Coding for errors and erasures in random NC. IEEE Trans Inf Theory 54:3579–3591
Li Y, Yao H, Chen M, Jaggi S, Rosen A (2010) RIPPLE authentication for network coding. In: INFOCOM, pp 2258–2266
Elias Kehdi, Baochun Li (2009) Null keys limiting malicious attacks via null space properties of network coding. In: Infocom, pp 1224–1232
Zhao F, Kalker T, Medard M, Han KJ (2007) Signatures for content distribution with network coding. In: IEEE international symposium on information theory (ISIT), pp 556–560
Mahmoud ME (2011) An integrated stimulation and punishment mechanism for thwarting packet dropping attack in multihop wireless networks. IEEE Trans Veh Technol 60:3947–3962
Gkantsidis C, Rodriguez P (2006) Cooperative security for network coding file distribution. In: INFOCOM, pp 1–13
Acknowledgments
This work is supported by Program for Changjiang Scholars and Innovative Research Team in University(No.IRT1012), “Network technology” Aid program for Science and Technology Innovative Research Team in Higher Educational Institutions of Hunan Province, Hunan Provincial Natural Science Foundation of China (11JJ7003), “Reconfigurable Network Emulation Testbed for Basic Network Communication” Program for National Basic Research Program of China (973 Program).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, M., Chen, L., Wang, H., Gong, Z., Dai, F. (2013). Efficient Authentication Based on Orthogonality and Timeliness for Network Coding. In: Lu, W., Cai, G., Liu, W., Xing, W. (eds) Proceedings of the 2012 International Conference on Information Technology and Software Engineering. Lecture Notes in Electrical Engineering, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34528-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-34528-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34527-2
Online ISBN: 978-3-642-34528-9
eBook Packages: EngineeringEngineering (R0)