A Code and Rate Equivalence Between Secure Network and Index Coding

Establishing code equivalences between index coding and network coding provides important insights for code design. Previous works showed an equivalence relation between any index-coding instance and a network-coding instance, for which a code for one instance can be translated to a code for the other instance with the same decoding-error performance. The equivalence also showed a surprising result that any network-coding instance can be mapped to an index-coding instance with a properly designed code translation. In this article, we extend the existing equivalence (instance map and code translation) to one between secure index coding and secure network coding, where eavesdroppers are present in the network. In the secure setting, any code construction needs to guarantee security constraints in addition to decoding-error performance. A rate equivalence between these two problems is also established.

[1]  Aaron B. Wagner,et al.  A Rate–Distortion Approach to Index Coding , 2014, IEEE Transactions on Information Theory.

[2]  Alexandros G. Dimakis,et al.  Local graph coloring and index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[3]  Jörg Kliewer,et al.  Equivalence for networks with adversarial state , 2014, 2014 IEEE International Symposium on Information Theory.

[4]  Swanand Kadhe,et al.  Private Information Retrieval With Side Information , 2017, IEEE Transactions on Information Theory.

[5]  Wentao Huang,et al.  On secure network coding with uniform wiretap sets , 2013, 2013 International Symposium on Network Coding (NetCod).

[6]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

[7]  Ning Cai,et al.  Theory of Secure Network Coding , 2011, Proceedings of the IEEE.

[8]  Ning Cai,et al.  Secure Network Coding on a Wiretap Network , 2011, IEEE Transactions on Information Theory.

[9]  Mohammad Reza Aref,et al.  Perfectly Secure Index Coding , 2015, IEEE Transactions on Information Theory.

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

[11]  Robert D. Kleinberg,et al.  Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate , 2013, IEEE Transactions on Information Theory.

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

[13]  Matthieu R. Bloch,et al.  Covert Communication Over Noisy Channels: A Resolvability Perspective , 2015, IEEE Transactions on Information Theory.

[14]  Jörg Kliewer,et al.  An Equivalence between Secure Network and Index Coding , 2017, 2016 IEEE Globecom Workshops (GC Wkshps).

[15]  Randall Dougherty,et al.  Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks , 2006, IEEE Transactions on Information Theory.

[16]  Lele Wang,et al.  On the capacity region for index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[17]  Jörg Kliewer,et al.  Secure index coding: Existence and construction , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[18]  Michael Langberg,et al.  An Equivalence Between Network Coding and Index Coding , 2012, IEEE Transactions on Information Theory.

[19]  Alexander Sprintson,et al.  On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.

[20]  Yuxin Liu,et al.  On the Capacity Region for Secure Index Coding , 2018, 2018 IEEE Information Theory Workshop (ITW).

[21]  Yeow Meng Chee,et al.  On the Security of Index Coding With Side Information , 2011, IEEE Transactions on Information Theory.

[22]  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.

[23]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.