Codes against Online Adversaries
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg

TL;DR
This paper studies the limits of reliable communication over channels with online adversarial jammers, providing tight theoretical bounds and efficient coding schemes for various delay and jamming models.
Contribution
It introduces the first tight characterizations of achievable communication rates against online adversaries with delay constraints and constructs efficient codes to attain these rates.
Findings
Tight rate bounds for 0-delay and d-delay online adversarial models.
Optimal codes are computationally efficient.
Results extend to jam-or-listen online adversary scenarios.
Abstract
In this work we consider the communication of information in the presence of an online adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x=x_1,...,x_n symbol-by-symbol over a communication channel. The adversarial jammer can view the transmitted symbols x_i one at a time, and can change up to a p-fraction of them. However, the decisions of the jammer must be made in an online or causal manner. More generally, for a delay parameter 0<d<1, we study the scenario in which the jammer's decision on the corruption of x_i must depend solely on x_j for j < i - dn. In this work, we initiate the study of codes for online adversaries, and present a tight characterization of the amount of information one can transmit in both the 0-delay and, more generally, the d-delay online setting. We prove tight results for both…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Malware Detection Techniques · Internet Traffic Analysis and Secure E-voting · Cryptographic Implementations and Security
