Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization

Abstract

We introduce explicit schemes based on the polarization phenomenon for the tasks of one-way secret key agreement from common randomness and private channel coding. For the former task, we show how to use common randomness and insecure one-way communication to obtain a strongly secure key such that the key construction has a complexity essentially linear in the blocklength and the rate at which the key is produced is optimal, i.e., equal to the one-way secret-key rate. For the latter task, we present a private channel coding scheme that achieves the secrecy capacity using the condition of strong secrecy and whose encoding and decoding complexity are again essentially linear in the blocklength.

18.1 pages, 2 figures, 2 tables

References in corpus (2)

• Nested Polar Codes for Wiretap and Relay Channels
• Achieving the Capacity of any DMC using only Polar Codes

Cited by in corpus (7)

• Universal Polar Codes for More Capable and Less Noisy Channels and Sources
• Wiretap Secret Key Capacity of Tree-PIN
• Polar Coding for the General Wiretap Channel
• Alignment of Polarized Sets
• Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation
• Information-theoretic Key Encapsulation and its Applications
• A Channel Model of Transceivers for Multiterminal Secret Key Agreement