Cooperative Defense Against Pollution Attacks in Network Coding Using SpaceMac
- 23 January 2012
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 30 (2) , 442-449
Abstract
Intra-session network coding is inherently vulnerable to pollution attacks. In this paper, first, we introduce a novel homomorphic MAC scheme called SpaceMac, which allows an intermediate node to verify whether received packets belong to a specific subspace, even if the subspace is expanding over time. Then, we use SpaceMac as a building block to design a cooperative scheme that provides complete defense against pollution attacks: (i) it can detect polluted packets early at intermediate nodes, and (ii) it can identify the exact location of all, even colluding, attackers, thus making it possible to eliminate them. Our scheme is cooperative: parents and children of any node cooperate to detect any corrupted packets sent by the node, and nodes in the network cooperate with a central controller to identify the exact location of all attackers. We implement SpaceMac in both C/C++ and Java as a library, which we make publicly available. Our evaluation on both a PC and an Android device shows that the SpaceMac algorithms can be computed quickly and efficiently and that our cooperative defense scheme has low computation overhead and significantly lower communication overhead than those of state-of-the-art schemes.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Cooperative Defense Against Pollution Attacks in Network Coding Using SpaceMacIEEE Journal on Selected Areas in Communications, 2012
- On counteracting Byzantine attacks in network coded peer-to-peer networksIEEE Journal on Selected Areas in Communications, 2010
- RIPPLE Authentication for Network Coding2010
- Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding2009
- Subspace Properties of Randomized Network Coding2007
- Coding for Errors and Erasures in Random Network Coding2007
- Cooperative Security for Network Coding File Distribution2006
- Correction of adversarial errors in networks2005
- On-the-fly verification of rateless erasure codes for efficient content distribution2004
- Network information flowIEEE Transactions on Information Theory, 2000