Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes

Abstract

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms of Bob's probability of error in recovering the message, while security is measured in terms of the mutual information between the message and Eve's observations. Wyner showed that the situation is characterized by a single constant C_s, called the secrecy capacity, which has the following meaning: for all $\epsilon >0$, there exist coding schemes of rate $R\ge C_s-\epsilon$ that asymptotically achieve both the reliability and the security objectives. However, his proof of this result is based upon a nonconstructive random-coding argument. To date, despite a considerable research effort, the only case where we know how to construct coding schemes that achieve secrecy capacity is when Eve's channel C_2 is an erasure channel, or a combinatorial variation thereof. Polar codes were recently invented by Arikan; they approach the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Herein, we use polar codes to construct a coding scheme that achieves the secrecy capacity of general wiretap channels. Our construction works for any instantiation of the wiretap channel model, as originally defined by Wyner, as long as both C_1 and C_2 are symmetric and binary-input. Moreover, we show how to modify our construction in order to achieve strong security, as defined by Maurer, while still operating at a rate that approaches the secrecy capacity. In this case, we cannot guarantee that the reliability condition will be satisfied unless the main channel C_1 is noiseless, although we believe it can be always satisfied in practice.

16 pages, 5 figures, published in the IEEE Transactions on Information Theory, vol. 57, no. 10, October 2011. arXiv admin note: substantial text overlap with arXiv:1001.0210

References in corpus (3)

• Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
• Nested Polar Codes for Wiretap and Relay Channels
• Strong Secrecy for Erasure Wiretap Channels

Cited by in corpus (32)

• Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
• Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
• Quantum secure direct communication with private dense coding using general preshared quantum state
• Efficient Quantum Polar Coding
• Polar Codes For Broadcast Channels
• Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization
• Polar codes for private and quantum communication over arbitrary channels
• Artificial Noise Revisited
• Filter Design with Secrecy Constraints: The MIMO Gaussian Wiretap Channel
• Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding
• Relaxed Polar Codes
• Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding
• Securing Data in Multimode Fibers by Exploiting Mode-Dependent Light Propagation Effects
• Secret Key Agreement with Large Antenna Arrays under the Pilot Contamination Attack
• Polar codes for degradable quantum channels
• Efficient Quantum Polar Codes Requiring No Preshared Entanglement
• Polar Codes' Simplicity, Random Codes' Durability
• Duality of channels and codes
• Universal Polar Codes for More Capable and Less Noisy Channels and Sources
• Information-theoretic Physical Layer Security for Satellite Channels
• Alignment of Polarized Sets
• Secure Computation-and-Forward with Linear Codes
• Polar Codes for Distributed Hierarchical Source Coding
• Channel Polarization through the Lens of Blackwell Measures
• The Wiretap Channel for Capacitive PUF-Based Security Enclosures
• Exact correct-decoding exponent of the wiretap channel decoder
• Smoothing of binary codes, uniform distributions, and applications
• Physical layer insecurity
• On Secret-Message Transmission by Echoing Encrypted Probes
• Polar Coding for Achieving the Capacity of Marginal Channels in Nonbinary-Input Setting
• Threshold-Secure Coding with Shared Key
• On the Construction of Polar Codes for Achieving the Capacity of Marginal Channels