Secret Writing on Dirty Paper: A Deterministic View

TL;DR

This paper explores the secrecy capacity of wiretap channels with side information using a deterministic approach, providing new insights and coding schemes that achieve near-optimal secrecy rates in Gaussian models.

Contribution

It offers a deterministic characterization of the secrecy capacity for wiretap channels with side information and proposes a coding scheme that nearly achieves the capacity in Gaussian models.

Findings

Exact secrecy capacity for the deterministic model.

Coding scheme achieving within half a bit of Gaussian model capacity.

Insight into secret writing on dirty paper.

Abstract

Recently there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as "secret writing on dirty paper") to within half a bit.