Network Coding with Myopic Adversaries

by   Sijie Li, et al.

We consider the problem of reliable communication over a network containing a hidden myopic adversary who can eavesdrop on some z_ro links, jam some z_wo links, and do both on some z_rw links. We provide the first information-theoretically tight characterization of the optimal rate of communication possible under all possible settings of the tuple (z_ro,z_wo,z_rw) by providing a novel coding scheme/analysis for a subset of parameter regimes. In particular, our vanishing-error schemes bypass the Network Singleton Bound (which requires a zero-error recovery criteria) in a certain parameter regime where the capacity had been heretofore open. As a direct corollary we also obtain the capacity of the corresponding problem where information-theoretic secrecy against eavesdropping is required in addition to reliable communication.


page 1

page 2

page 3

page 4


Network Coding-Based Post-Quantum Cryptography

We propose a novel hybrid universal network-coding cryptosystem (HUNCC) ...

Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes

Multishot network coding is considered in a worst-case adversarial setti...

Multipath Stealth Communication with Jammers

We consider the problem of stealth communication over a multipath networ...

Covert Communication over Adversarially Jammed Channels

We consider a situation in which a transmitter Alice may wish to communi...

Ultra-Reliable Communication over Arbitrarily Varying Channels under Block-Restricted Jamming

Ultra-Reliable Communication (URC) is examined in an information-theoret...

Network Decoding

We consider the problem of error control in a coded, multicast network, ...

Stealth Communication with Vanishing Power over Binary Symmetric Channels

A framework for stealth communication with vanishing power (VP) is prese...