Cooperative defense against pollution attacks in network coding using SpaceMac

51Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.
Get full text

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. © 2006 IEEE.

Cite

CITATION STYLE

APA

Le, A., & Markopoulou, A. (2012). Cooperative defense against pollution attacks in network coding using SpaceMac. IEEE Journal on Selected Areas in Communications, 30(2), 442–449. https://doi.org/10.1109/JSAC.2012.120224

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free