Efficient Codes for Adversarial Wiretap Channels

TL;DR

This paper introduces the first efficient, capacity-achieving coding scheme for the adversarial wiretap channel model, ensuring perfect secrecy even when an adversary can observe and modify parts of the transmitted codeword.

Contribution

It presents the first efficient construction of capacity-achieving codes for the AWTP channel model with perfect secrecy.

Findings

Achieves capacity for the AWTP channel

Provides perfect secrecy against adaptive adversaries

Efficient encoding and decoding algorithms

Abstract

In [13] we proposed a ({\rho}_r , {\rho}_w )-adversarial wiretap channel model (AWTP) in which the adversary can adaptively choose to see a fraction {\rho}_r of the codeword sent over the channel, and modify a fraction {\rho}_w of the codeword by adding arbitrary noise values to them. In this paper we give the first efficient construction of a capacity achieving code family that provides perfect secrecy for this channel.