Abstract
Compared with the traditional route-based network theory, there are lots of characteristics and advantages of network coding technology in Wireless Sensor Networks (WSN). At the same time, it is facing a variety of security threats, especially wiretapping Attack. Existing network coding security policies are mostly focused on building secure coding strategy, compared to the secure coding design strategies, security topology design strategies are much less. In this paper, we propose a weakly-secure network topology algorithm based on network segmentation. Simulations show that the proposed strategy can prevent cooperative eavesdroppers from acquiring any useful information transmitted from source node to sink node.
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
Ahlswede R, Cai N, Li S-YR, Yeung RW (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204–1216
Koetter R, Medard M (2003) An algebraic approach to network coding. IEEE/ACM Trans Networking 11(5):782–795
Li S, Yeung R, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49(2):371–381
Yu Z, Wei Y, Ramkumar B, Guan Y (2008) An efficient signature-based scheme for securing network coding against pollution attacks. Proceedings of IEEE INFOCOM 2008, the 27th conference on computer communication, Phoenix, Arizona, USA, pp 1409–1417
Ho T, Leong B, Koetter R, Medard M, Effros M, Karger D (2004) Byzantine modification detection in multicast networks using randomized network coding. Proceedings of IEEE international symposium on information theory (ISIT), Chicago, Illinois, USA, p 144
Jaggi S, Langberg M, Katti S, Ho T, Katabi D, Medard M (2007) Resilient network coding in the presence of byzantine adversaries. Proceedings of IEEE INFOCOM 2007, the 26th conference on computer communications, Nice, pp 616–624
Krohn M, Freedman M, Mazières D (2004) On-the-fly verification of rateless erasure codes for efficient content distribution. In: IEEE Symp on Security and Privacy, Oakland, CA, pp 226–240
Gkantsidis C, Rodriguez PR (2006) Cooperative security for network coding file distribution. Proceedings of INFOCOM 2006, the 25th IEEE international conference on computer communications, Barcelona, Spain, pp 1–13
Cai N, Yeung R (2002) Secure network coding. Proceedings of IEEE international symposium on information theory (ISIT), Palais de Beaulieu, Lausanne, Switzerland, p 323
Feldman J, Malkin T, Stein C, Servedion RA (2004) On the capacity of secure network coding. Proceedings of the 42nd annual allerton conference on communication, control, and computing, Monticello, Illinois, USA
Cai N, Yeung RW (2007) A security condition for multi-source linear network coding. IEEE international symposium on information theory, Nice, France, pp 561–565
Zhang Z, Yeung Raymond W (2009) A general security condition for multi-source. Linear network coding.http://iest2.ie.cuhk.edu.hk/Whyeung/publications/zxzhang-security.pdf
CaI NT, Grant A (2008) Capacity bounds for secure network coding. IEEE communication theory workshop, St. Croix, US Virgin Islands, pp 95–100
Bhattad K, Narayanan KR (2005) Weakly secure network coding. First workshop on network coding, theory and applications, Riva del Garda, Italy
Silva D, Kschischang FR (2009) Universal weakly secure network coding. Information theory workshop on networking and information theory, Volos, Greece, pp 281–285
Jain K (2004) Security based on network topology against the wiretapping attack. IEEE Wirel Commun 11(1):68–71
Jing D, Curtmola R, Sethi R, et al (2008) Toward secure network coding in wireless networks: threats and challenges. 4th workshop on secure network protocols, Orlando, Florida, pp 33–38
Mills A, Smith B, Clancy TC et al (2008) On secure communication over wireless erasure networks. IEEE international symposium on information theory, Toronto, Ontario, Canada, pp 161–165
Fancsali SZ, Ligeti LP (2008) Some applications of finite geometry for secure network coding. J Math Cryptol 2(3):1862–2984
Hassanzadeh MM, Ravanbakhsh M, Ytrehu SO (2008) Two layer secure network coding-(2-LSNC). IEEE international symposium on telecommunications, Tehran, Iran, pp 7.12
Harada K, Yamamoto H (2008) Strongly secure linear network coding. IEICE Trans Fundam E91-A(10):2720–2728
Du R, Zhao C, Zhao F, Li S (2012) A strategy of network coding against nodes conspiracy attack. The international conference on communications, signal processing, and systems, Beijing, China
Acknowledgment
This work is funded by National Science Foundation of China (61271316, 61071152, 61271180), 973 Program (2010CB731403, 2010CB731406, 2013CB329605) of China, Chinese National “Twelfth Five-Year” Plan for Science & Technology Support (2012BAH38 B04), Key Laboratory for Shanghai Integrated Information Security Management Technology Research, and Chinese National Engineering Laboratory for Information Content Analysis Technology.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Du, R., Zhao, C., Li, S., Li, J. (2014). A Strategy of Network Coding Against Wiretapping Attack Based on Network Segmentation. In: Zhang, B., Mu, J., Wang, W., Liang, Q., Pi, Y. (eds) The Proceedings of the Second International Conference on Communications, Signal Processing, and Systems. Lecture Notes in Electrical Engineering, vol 246. Springer, Cham. https://doi.org/10.1007/978-3-319-00536-2_130
Download citation
DOI: https://doi.org/10.1007/978-3-319-00536-2_130
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00535-5
Online ISBN: 978-3-319-00536-2
eBook Packages: EngineeringEngineering (R0)