Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys

It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to z network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances — a well known open problem. This work treats an intermediate model of secure unicast in which only one node can generate random keys, however that node need not be the source node. The secure communication rate for this setting is characterized again with an eavesdropper that has access to z network links.

[1]  Tracey Ho,et al.  On Capacity Region of Wiretap Networks , 2012, ArXiv.

[2]  M. Medard,et al.  On the multiple unicast network coding, conjecture , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  T. Chan,et al.  Capacity bounds for secure network coding , 2008, 2008 Australian Communications Theory Workshop.

[4]  Frank R. Kschischang,et al.  Universal Secure Network Coding via Rank-Metric Codes , 2008, IEEE Transactions on Information Theory.

[5]  Ning Cai,et al.  A Security Condition for Multi-Source Linear Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[6]  Ning Cai,et al.  On the optimality of a construction of secure network codes , 2008, 2008 IEEE International Symposium on Information Theory.

[7]  R. Yeung,et al.  Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[8]  Wentao Huang,et al.  Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding , 2018, IEEE Transactions on Information Theory.

[9]  Emina Soljanin,et al.  Secure Network Coding for Wiretap Networks of Type II , 2009, IEEE Transactions on Information Theory.

[10]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[11]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[12]  Tracey Ho,et al.  On Secure Network Coding With Nonuniform or Restricted Wiretap Sets , 2009, IEEE Transactions on Information Theory.

[13]  Christina Fragouli,et al.  Network Coding Fundamentals , 2007, Found. Trends Netw..

[14]  Jon Feldman,et al.  On the Capacity of Secure Network Coding , 2004 .

[15]  Alex J. Grant,et al.  Network Coding Capacity Regions via Entropy Functions , 2012, IEEE Transactions on Information Theory.