Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels

TL;DR

This paper proposes a polar coding scheme for binary-input memoryless symmetric wire-tap channels that achieves the full rate-equivocation region under weak secrecy, with specific proofs for erasure channels and extensions to non-degraded channels.

Contribution

It introduces a polar coding scheme that achieves the entire rate-equivocation region for symmetric and degraded wire-tap channels, including new proofs for erasure channels and generalizations.

Findings

Achieves full rate-equivocation region for symmetric degraded wire-tap channels

Provides an alternative proof for binary erasure wire-tap channels

Extends results to non-degraded wire-tap channels

Abstract

A polar coding scheme is introduced in this paper for the wire-tap channel. It is shown that the provided scheme achieves the entire rate-equivocation region for the case of symmetric and degraded wire-tap channel, where the weak notion of secrecy is assumed. For the particular case of binary erasure wire-tap channel, an alternative proof is given. The case of general non-degraded wire-tap channels is also considered.