A Caltech Library Service

Reverse Edge Cut-Set Bounds for Secure Network Coding

Huang, Wentao and Ho, Tracey and Langberg, Michael and Kliewer, Joerg (2014) Reverse Edge Cut-Set Bounds for Secure Network Coding. In: 2014 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 106-110. ISBN 978-1-4799-5186-4.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription Paper
Huang, Wentao0000-0003-0963-3624
Langberg, Michael0000-0002-7470-0718
Additional Information:© 2014 IEEE. This work has been supported in part by NSF Grant CNS-0905615, CCF-1440001, CCF-1440014 and CCF-1038578.
Funding AgencyGrant Number
Record Number:CaltechAUTHORS:20150227-080252781
Persistent URL:
Official Citation:Wentao Huang; Ho, T.; Langberg, M.; Kliewer, J., "Reverse edge cut-set bounds for secure network coding," Information Theory (ISIT), 2014 IEEE International Symposium on , vol., no., pp.106,110, June 29 2014-July 4 2014 doi: 10.1109/ISIT.2014.6874804 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:55314
Deposited By: Tony Diaz
Deposited On:04 Mar 2015 00:10
Last Modified:09 Mar 2020 13:18

Repository Staff Only: item control page