A Strategy of Network Coding Against Nodes Conspiracy Attack
In recent years network coding has attracted significant attention in telecommunication. The benefits of network coding to a communication network include the increased throughput as well as secure data transmission. In this chapter, we investigate the advantages of applying network Coding in sensor networks for security purpose. In particular, the problem of constructing a secure unicast system is considered. Unlike previous wiretapping scenarios, where the threat is posed by external wiretappers. we approach the security from an internal angle: all nodes comply with the communication protocols yet are potential eavesdroppers and the eavesdroppers can cooperate with each other to decode the packets sent from the source node. Different from most existing research on network coding that designs the network coding scheme based on a given topology, we will consider the network topology design. We first try to find the transmission topology that is suitable for network coding in unicast system. Based on the topology, we use linear network coding scheme which is weakly secure. We conduct simulations to show that it prevents cooperative eavesdroppers from acquiring any useful information transmitted from source node to sink node.
KeywordsWeakly-secure Network coding Cooperative eavesdroppers Conspiracy attack
This work is funded by National Science Foundation of China (61071152, 60702043), 973 Program (2010CB731403, 2010CB731406) of China and National “Twelfth Five-Year” Plan for Science & Technology Support (2012BAH38 B04).
- 3.Lima L, Medard M, Barros J (2007) Random linear network coding: a free cipher. In: Proceedings of IEEE international symposium on information theory (ISIT), Acropolis Congress and Exhibition Center, Nice, France 24th–29th June 2007, pp 546–550Google Scholar
- 4.Cai N, Yeung R (2002) Secure network coding. In: Proceedings of IEEE international symposium on information theory (ISIT), Palais de Beaulieu Lausanne, Switzerland, June 30–July 5, Chicago downtown Marriott, p 323Google Scholar
- 5.Feldman J, Malkin T, Stein C, Servedion RA (2004) On the capacity of secure network coding. In: Proceedings of the 42nd annual allerton conference on communication, control, and computing, Allerton House, Monticello, Illinois, USA, September 29–October 1Google Scholar
- 6.Bhattad K, Narayanan KR (2005) Weakly secure network coding. In: Proceedings of the first workshop on network coding, theory, and applications (Netcod), Riva del GardaGoogle Scholar
- 7.Yu Z, Wei Y, Ramkumar B, Guan Y (2008) An efficient signature-based scheme for securing network coding against pollution attacks. In: Proceedings of IEEE INFOCOM 2008, the 27th conference on computer communication, April 13–18, Phoenix, Arizona, USA, pp 1409–1417Google Scholar
- 8.Ho T, Leong B, koetter R, Medard M, Effros M, Karger D (2004) Byzantine modification detection in multicast networks using randomized network coding. In: Proceedings of IEEE international symposium on information theory (ISIT), Chicago downtown Marriott, Chicago, Illinois, USA, 6.27–7.2, p 144Google Scholar
- 9.Jaggi S, Langberg M, Katti S, Ho T, Katabi D, Medard M (2007) Resilinet network coding in the presence of byzantine adversaries. In: Proceedings of IEEE INFOCOM 2007, the 26th conference on computer communications, Acropolis Congress and Exhibition Center Nice, France, 24th–29th June, pp 616–624Google Scholar
- 10.Krohn M, Freedman M, Mazieres D (2004) On-the-fly verification of rateless erasure codes for efficient content distribution. In: Proceedings of IEEE symposium on security and privacy, May 9–12, Claremont Resort in Oakland, California, USA, pp 226–240Google Scholar
- 11.Gkantsidis C, Rodriguez PR (2006) Cooperative security for network coding file distribution. In: Proceedings of INFOCOM 2006 the 25th IEEE international conference on computer communications, Barcelona, Spain, 23–29, April, pp 1–13Google Scholar