Equivalence for networks with adversarial state

We address the problem of finding the capacity of networks with independent point-to-point channels where a subset of these channels is replaced either by a compound channel (CC) or an arbitrarily varying channel (AVC). These channels represent a good model for the presence of a Byzantine adversary which controls a subset of links or nodes in the network. We show that equivalence between this network and another network hold in the sense that all links can be replaced by noiseless bit-pipes with the same capacity as the noisy CC or nonsymmetrizable AVC, leading to identical capacity regions for both networks. We then strengthen these results by showing that an additional feedback path between the output and input of a CC or an additional forward path for the AVC extends the equivalent capacity region for both the noisy and the derived noiseless network. This explicitly includes the symmetrizable AVC case.

[1]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .

[2]  Jacob Wolfowitz.  Coding Theorems of Information Theory , 1962 .

[3]  Tracey Ho,et al.  Network Error Correction With Unequal Link Capacities , 2010, IEEE Transactions on Information Theory.

[4]  J. Wolfowitz.  Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

[5]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[6]  Yu Xiang,et al.  A few meta-theorems in network information theory , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[7]  Lang Tong,et al.  Nonlinear network coding is necessary to combat general Byzantine attacks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[9]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[10]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  H. Vincent Poor,et al.  On the Continuity of the Secrecy Capacity of Compound and Arbitrarily Varying Wiretap Channels , 2014, IEEE Transactions on Information Forensics and Security.

[13]  R. Ahlswede.  Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[14]  Tracey Ho,et al.  On equivalence between network topologies , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[15]  Mayank Bakshi,et al.  On equivalence for networks of noisy channels under byzantine attacks , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[16]  Lang Tong,et al.  Polytope codes against adversaries in networks , 2010, 2010 IEEE International Symposium on Information Theory.

[17]  Muriel Médard,et al.  A Theory of Network Equivalence – Part II: Multiterminal Channels , 2014, IEEE Transactions on Information Theory.

[18]  Moritz Wiese,et al.  The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability, and Super-Activation , 2016, IEEE Trans. Inf. Theory.

[19]  Brian L. Hughes.  The smallest list for the arbitrarily varying channel , 1997, IEEE Trans. Inf. Theory.

[20]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[21]  Runyao Duan,et al.  Super-Activation of Zero-Error Capacity of Noisy Quantum Channels , 2009, 0906.2527.

[22]  Lang Tong,et al.  Polytope codes against adversaries in networks , 2010, ISIT.

[23]  Gou Hosoya,et al.  国際会議参加報告:2014 IEEE International Symposium on Information Theory , 2014 .

[24]  Tracey Ho,et al.  On the impact of a single edge on the network coding capacity , 2011, 2011 Information Theory and Applications Workshop.

[25]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[26]  Alon Orlitsky,et al.  Coding for computing , 2001, IEEE Trans. Inf. Theory.

[27]  Moritz Wiese,et al.  The Arbitrarily Varying Wiretap Channel—Secret Randomness, Stability, and Super-Activation , 2016, IEEE Transactions on Information Theory.

[28]  Michael Langberg,et al.  Network coding: Is zero error always possible? , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[29]  Muriel Médard,et al.  A Theory of Network Equivalence— Part I: Point-to-Point Channels , 2011, IEEE Transactions on Information Theory.

[30]  Imre Csiszár,et al.  The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.

[31]  Muriel Médard,et al.  On a theory of network equivalence , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.