On secure network coding with unequal link capacities and restricted wiretapping sets

Tao Cui, Tracey Ho, Jorg Kliewer

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

12 Scopus citations

Abstract

We address secure network coding over networks with unequal link capacities in the presence of a wiretapper who has only access to a restricted number of k links in the network. Previous results show that for the case of equal link capacities and unrestricted wiretapping sets, the secrecy capacity is given by the cut-set bound, whether or not the location of the wiretapped links is known. The cut-set bound can be achieved by injecting k random keys at the source which are decoded at the sink along with the message. In contrast, for the case where the wiretapping set is restricted, or where link capacities are not equal, we show that the cut-set bound is not achievable in general. Finally, it is shown that determining the secrecy capacity is a NP-hard problem.

Original languageEnglish (US)
Title of host publication2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
DOIs
StatePublished - Dec 1 2010
Externally publishedYes
Event2010 IEEE Information Theory Workshop, ITW 2010 - Dublin, Ireland
Duration: Aug 30 2010Sep 3 2010

Publication series

Name2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Other

Other2010 IEEE Information Theory Workshop, ITW 2010
CountryIreland
CityDublin
Period8/30/109/3/10

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On secure network coding with unequal link capacities and restricted wiretapping sets'. Together they form a unique fingerprint.

Cite this