Achievable strategies for general secure network coding

Tao Cui, Tracey Ho, Jörg Kliewer

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

7 Scopus citations

Abstract

This paper considers secure network coding over networks with restricted wiretapping sets and unequal link capacities in the presence of a wiretapper that can wiretap any subset of k links. In particular, we consider networks with point-to-point erasure channels. Existing results for wireline networks show that for the case of both unrestricted wiretapping sets and equal (unit) link capacities, the secrecy capacity is given by the cut-set bound, whether or not the location of the wiretapped links is known, and can be achieved by injecting k random keys at the source which are decoded at the sink along with the message. In contrast, for restricted wiretapping sets and unequal link capacities we show that this global key strategy is suboptimal. In particular, we propose achievable strategies where random keys are canceled at intermediate non-sink nodes, injected at intermediate non-source nodes, or a combination of both strategies is considered.

Original languageEnglish (US)
Title of host publication2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
Pages223-228
Number of pages6
DOIs
StatePublished - May 31 2010
Externally publishedYes
Event2010 Information Theory and Applications Workshop, ITA 2010 - San Diego, CA, United States
Duration: Jan 31 2010Feb 5 2010

Publication series

Name2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings

Other

Other2010 Information Theory and Applications Workshop, ITA 2010
CountryUnited States
CitySan Diego, CA
Period1/31/102/5/10

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'Achievable strategies for general secure network coding'. Together they form a unique fingerprint.

Cite this