Paper 2010/183

Preventing Pollution Attacks in Multi-Source Network Coding

Shweta Agrawal, Dan Boneh, Xavier Boyen, and David Mandell Freeman


Network coding is a method for achieving channel capacity in networks. The key idea is to allow network routers to linearly mix packets as they traverse the network so that recipients receive linear combinations of packets. Network coded systems are vulnerable to pollution attacks where a single malicious node floods the network with bad packets and prevents the receiver from decoding correctly. Cryptographic defenses to these problems are based on homomorphic signatures and MACs. These proposals, however, cannot handle mixing of packets from multiple sources, which is needed to achieve the full benefits of network coding. In this paper we address integrity of multi-source mixing. We propose a security model for this setting and provide a generic construction.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Full version of paper to appear in PKC 2010
network codingsignatures
Contact author(s)
dfreeman @ cs stanford edu
2010-04-09: received
Short URL
Creative Commons Attribution


      author = {Shweta Agrawal and Dan Boneh and Xavier Boyen and David Mandell Freeman},
      title = {Preventing Pollution Attacks in Multi-Source Network Coding},
      howpublished = {Cryptology ePrint Archive, Paper 2010/183},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.