Secure coding over networks against noncooperative eavesdropping

Jin Xu, Biao Chen

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper studies the problem of secure communication over a noiseless network from an information-theoretic perspective. A single-source single-sink acyclic planar network is considered, and the communication between the source and the sink is subject to noncooperative eavesdropping on each link. Using equivocation to measure the confidentiality of messages, we establish sufficient conditions, in terms of communication rates and network parameters, for provably secure communication. A constructive proof, which combines Shannon's key encryption and the Ford-Fulkerson algorithm, is provided and constitutes a readily implementable secure coding scheme. The derived achievable rate equivocation region is tight when specializing to several special cases. In particular, when the communication network decouples into nonoverlapping parallel paths, the proposed encoding scheme is optimal, i.e., it achieves the secure communication capacity for such networks.

Original languageEnglish (US)
Article number6502716
Pages (from-to)4498-4509
Number of pages12
JournalIEEE Transactions on Information Theory
Volume59
Issue number7
DOIs
StatePublished - Jul 2013

Fingerprint

coding
communication
Communication
Telecommunication networks
Cryptography
Secure communication

Keywords

  • Communication networks
  • Noncooperative eavesdropping
  • Provable security
  • Secure communication

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Secure coding over networks against noncooperative eavesdropping. / Xu, Jin; Chen, Biao.

In: IEEE Transactions on Information Theory, Vol. 59, No. 7, 6502716, 07.2013, p. 4498-4509.

Research output: Contribution to journalArticle

@article{0659e22e744b4c3986ccf5ae3bf6cd96,
title = "Secure coding over networks against noncooperative eavesdropping",
abstract = "This paper studies the problem of secure communication over a noiseless network from an information-theoretic perspective. A single-source single-sink acyclic planar network is considered, and the communication between the source and the sink is subject to noncooperative eavesdropping on each link. Using equivocation to measure the confidentiality of messages, we establish sufficient conditions, in terms of communication rates and network parameters, for provably secure communication. A constructive proof, which combines Shannon's key encryption and the Ford-Fulkerson algorithm, is provided and constitutes a readily implementable secure coding scheme. The derived achievable rate equivocation region is tight when specializing to several special cases. In particular, when the communication network decouples into nonoverlapping parallel paths, the proposed encoding scheme is optimal, i.e., it achieves the secure communication capacity for such networks.",
keywords = "Communication networks, Noncooperative eavesdropping, Provable security, Secure communication",
author = "Jin Xu and Biao Chen",
year = "2013",
month = "7",
doi = "10.1109/TIT.2013.2252393",
language = "English (US)",
volume = "59",
pages = "4498--4509",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Secure coding over networks against noncooperative eavesdropping

AU - Xu, Jin

AU - Chen, Biao

PY - 2013/7

Y1 - 2013/7

N2 - This paper studies the problem of secure communication over a noiseless network from an information-theoretic perspective. A single-source single-sink acyclic planar network is considered, and the communication between the source and the sink is subject to noncooperative eavesdropping on each link. Using equivocation to measure the confidentiality of messages, we establish sufficient conditions, in terms of communication rates and network parameters, for provably secure communication. A constructive proof, which combines Shannon's key encryption and the Ford-Fulkerson algorithm, is provided and constitutes a readily implementable secure coding scheme. The derived achievable rate equivocation region is tight when specializing to several special cases. In particular, when the communication network decouples into nonoverlapping parallel paths, the proposed encoding scheme is optimal, i.e., it achieves the secure communication capacity for such networks.

AB - This paper studies the problem of secure communication over a noiseless network from an information-theoretic perspective. A single-source single-sink acyclic planar network is considered, and the communication between the source and the sink is subject to noncooperative eavesdropping on each link. Using equivocation to measure the confidentiality of messages, we establish sufficient conditions, in terms of communication rates and network parameters, for provably secure communication. A constructive proof, which combines Shannon's key encryption and the Ford-Fulkerson algorithm, is provided and constitutes a readily implementable secure coding scheme. The derived achievable rate equivocation region is tight when specializing to several special cases. In particular, when the communication network decouples into nonoverlapping parallel paths, the proposed encoding scheme is optimal, i.e., it achieves the secure communication capacity for such networks.

KW - Communication networks

KW - Noncooperative eavesdropping

KW - Provable security

KW - Secure communication

UR - http://www.scopus.com/inward/record.url?scp=84897699290&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897699290&partnerID=8YFLogxK

U2 - 10.1109/TIT.2013.2252393

DO - 10.1109/TIT.2013.2252393

M3 - Article

AN - SCOPUS:84897699290

VL - 59

SP - 4498

EP - 4509

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

M1 - 6502716

ER -