On the capacity of the binary adversarial wiretap channel

Abstract

New bounds on the semantic secrecy capacity of the binary adversarial wiretap channel are established . Against an adversary which reads a ${\rho }_r$ fraction of the transmitted codeword and modifies a ${\rho }_w$ fraction of the codeword, we show an achievable rate of $1-h({\rho }_w)-{\rho }_r$, where $h(\cdot )$ is the binary entropy function. We also give an upper bound which is nearly matching when ${\rho }_r$ is small.

v2: Capacity upper bound has been corrected