Preventing Pollution Attacks in Multi-source Network Coding

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

In Public Key Cryptography (PKC 2010), volume 6056 of Lecture Notes in Computer Science, pages 161-176. Springer, 2010.


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.


- published paper (PS) (PDF) (also accessible from the publisher) © IACR
- full version (PS) (PDF)
- presentation slides (HTML)


  author = {Shweta Agrawal and Dan Boneh and Xavier Boyen and David Mandell Freeman},
  title = {Preventing Pollution Attacks in Multi-source Network Coding},
  booktitle = {Public Key Cryptography---PKC 2010},
  series = {Lecture Notes in Computer Science},
  volume = {6056},
  pages = {161--176},
  publisher = {Berlin: Springer-Verlag},
  year = {2010},
  note = {Available at \url{}}

Unless indicated otherwise, these documents are Copyright © Xavier Boyen; all rights reserved in all countries.
Back to Xavier's homepage