Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric 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.

References in corpus (2)

• Nested Polar Codes for Wiretap and Relay Channels
• Polar Codes: Characterization of Exponent, Bounds, and Constructions

Cited by in corpus (6)

• Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization
• Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity
• Coding for Cryptographic Security Enhancement using Stopping Sets
• Greedy-Merge Degrading has Optimal Power-Law
• Universal polar coding and sparse recovery
• Channel Upgradation for Non-Binary Input Alphabets and MACs