Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization
This work addresses secure key generation and private coding for communication systems, offering efficient solutions with strong secrecy guarantees.
The paper tackles the problem of secure communication by introducing explicit schemes for one-way secret key agreement and private channel coding using polarization, achieving optimal rates and linear complexity in blocklength.
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.