Secure coding over networks

Jin Xu, Biao Chen

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

2 Scopus citations

Abstract

In this paper we study the problem of secure communication over a network in which each link may be noisy or noiseless. A single-source single-sink acyclic planar network is considered, and the communication between the source and the sink is subject to non-cooperating eavesdropping on each link. Sufficient conditions, in terms of communication rates and network parameters, are found for provable secure communication, along with an intuitive and efficient coding scheme. The derived achievable rate equivocation region is tight when specializing to several special cases.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages2116-2120
Number of pages5
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

Keywords

  • Networks
  • Secure communication

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Secure coding over networks'. Together they form a unique fingerprint.

  • Cite this

    Xu, J., & Chen, B. (2009). Secure coding over networks. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 2116-2120). [5205251] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205251