Cooperative defense against pollution attacks in network coding using SpaceMac

  • Le A
  • Markopoulou A
  • 36

    Readers

    Mendeley users who have this article in their library.
  • 30

    Citations

    Citations of this article.

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.

Author-supplied keywords

  • Communication networks
  • communication system security
  • cooperative systems
  • cryptographic protocols
  • message authentication
  • network coding
  • pollution attacks

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free