Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization
arXiv:1304.3658 · doi:10.1007/978-3-642-42033-7_11
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.
arXiv comment18.1 pages, 2 figures, 2 tables
References in corpus (6)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
- Source Polarization
- Nested Polar Codes for Wiretap and Relay Channels
- Achieving the Capacity of any DMC using only Polar Codes
- Construction of wiretap codes from ordinary channel 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