Preventing pollution attacks in multi-source network coding

  • Authors:
  • Shweta Agrawal;Dan Boneh;Xavier Boyen;David Mandell Freeman

  • Affiliations:
  • University of Texas at Austin;Stanford University;Université de Liège, Belgium;Stanford University

  • Venue:
  • PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.