Efficient signature scheme for network coding

Ely Porat, Erez Waisbard

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


Network coding helps maximize the network throughput. However, such schemes are also vulnerable to pollution attacks in which malicious forwarders inject polluted messages into the system. Traditional cryptographic solution, such as digital signatures, are not suited for network coding, in which nodes do not forward the original packets, but rather linear combinations of the data they received. We describe secure scheme that uses batch techniques and selective verification to efficiently verify the integrity of the received packets. We show that for real peer-to-peer networks, our scheme is much more efficient than previously suggested schemes.

Original languageEnglish
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Number of pages5
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: 1 Jul 20126 Jul 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings


Conference2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA


  • Digital signatures
  • File sharing
  • Group testing
  • Homomorphic signatures
  • Network coding
  • Peer-to-peer


Dive into the research topics of 'Efficient signature scheme for network coding'. Together they form a unique fingerprint.

Cite this