TY - GEN
T1 - Reverse edge cut-set bounds for secure network coding
AU - Huang, Wentao
AU - Ho, Tracey
AU - Langberg, Michael
AU - Kliewer, Joerg
PY - 2014
Y1 - 2014
N2 - We consider the problem of secure communication over a network in the presence of wiretappers. We give a new cut-set bound on secrecy capacity which takes into account the contribution of both forward and backward edges crossing the cut, and the connectivity between their endpoints in the rest of the network. We show the bound is tight on a class of networks, which demonstrates that it is not possible to find a tighter bound by considering only cut-set edges and their connectivity.
AB - We consider the problem of secure communication over a network in the presence of wiretappers. We give a new cut-set bound on secrecy capacity which takes into account the contribution of both forward and backward edges crossing the cut, and the connectivity between their endpoints in the rest of the network. We show the bound is tight on a class of networks, which demonstrates that it is not possible to find a tighter bound by considering only cut-set edges and their connectivity.
UR - http://www.scopus.com/inward/record.url?scp=84906537169&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2014.6874804
DO - 10.1109/ISIT.2014.6874804
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84906537169
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 106
EP - 110
BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014
Y2 - 29 June 2014 through 4 July 2014
ER -