Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels
Information Theory
2015-03-17 v2 Cryptography and Security
math.IT
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.
Keywords
Cite
@article{arxiv.1005.2759,
title = {Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels},
author = {Eran Hof and Shlomo Shamai},
journal= {arXiv preprint arXiv:1005.2759},
year = {2015}
}