Security analysis of a protocol for pollution attack detection

Network coding is a technique for maximizing the use of available bandwidth capacity. This is achieved by having nodes not just forwarding packets but combining several incoming packets into a single outgoing packet for transmission. Unfortunately, network coding is vulnerable to pollution attacks where a single malicious node can disrupt the operation of the complete network. Several protocols to detect pollution attacks have been proposed in the literature. In this paper we describe a new pollution attack detection protocol that extends the existing SpaceMac protocol. This paper describes how we have modeled the protocol in order to carry out a security analysis and presents the results of that analysis.

[1]  Dan Boneh,et al.  Homomorphic MACs: MAC-Based Integrity for Network Coding , 2009, ACNS.

[2]  Tracey Ho,et al.  Byzantine Modification Detection in Multicast Networks With Random Network Coding , 2008, IEEE Transactions on Information Theory.

[3]  Reza Curtmola,et al.  Practical defenses against pollution attacks in wireless network coding , 2011, TSEC.

[4]  Fang Zhao,et al.  Signatures for Content Distribution with Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[5]  Baochun Li,et al.  Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding , 2009, IEEE INFOCOM 2009.

[6]  Xuemin Shen,et al.  Padding for orthogonality: Efficient subspace authentication for network coding , 2011, 2011 Proceedings IEEE INFOCOM.

[7]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[8]  Damla Turgut,et al.  39th Annual IEEE Conference on Local Computer Networks , 2014 .

[9]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[10]  Athina Markopoulou,et al.  Cooperative Defense Against Pollution Attacks in Network Coding Using SpaceMac , 2011, IEEE Journal on Selected Areas in Communications.

[11]  Fang Zhao,et al.  On counteracting Byzantine attacks in network coded peer-to-peer networks , 2009, IEEE Journal on Selected Areas in Communications.

[12]  Christos Gkantsidis,et al.  Cooperative Security for Network Coding File Distribution , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Athina Markopoulou,et al.  Locating Byzantine Attackers in Intra-Session Network Coding Using SpaceMac , 2010, 2010 IEEE International Symposium on Network Coding (NetCod).

[14]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[15]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[16]  David Mazières,et al.  On-the-fly verification of rateless erasure codes for efficient content distribution , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.