TY - GEN
T1 - Secure coding over networks
AU - Xu, Jin
AU - Chen, Biao
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
KW - Networks
KW - Secure communication
UR - http://www.scopus.com/inward/record.url?scp=70449485124&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449485124&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5205251
DO - 10.1109/ISIT.2009.5205251
M3 - Conference contribution
AN - SCOPUS:70449485124
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2116
EP - 2120
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -