On secure network coding with uniform wiretap sets

Wentao Huang, Tracey Ho, Michael Langberg, Joerg Kliewer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

This paper studies secure unicast communication over a network with uniform wiretap sets and shows that, when network nodes can independently generate randomness, determining the secrecy capacity is at least as difficult as the k-unicast network coding problem. In particular, we show that a general k-unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single unicast network with uniform link capacities and any one wiretap link. We propose a low-complexity linear optimization-based achievable strategy involving global random keys that can be generated anywhere in the network, and an efficient greedy algorithm that further improves achieveable rate by exploiting local random keys.

Original languageEnglish (US)
Title of host publication2013 International Symposium on Network Coding, NetCod 2013
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 International Symposium on Network Coding, NetCod 2013 - Calgary, AB, Canada
Duration: Jun 7 2013Jun 9 2013

Publication series

Name2013 International Symposium on Network Coding, NetCod 2013

Other

Other2013 International Symposium on Network Coding, NetCod 2013
CountryCanada
CityCalgary, AB
Period6/7/136/9/13

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software

Fingerprint Dive into the research topics of 'On secure network coding with uniform wiretap sets'. Together they form a unique fingerprint.

Cite this