Abstract
We study the state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes all instances of CSI availability as special cases, and calls for an efficient utilization of the state sequence for both reliability and security purposes. A lower bound on the secrecy-capacity, that improves upon the previously best known result published by Prabhakaran et al., is derived based on a novel superposition coding scheme. Our achievability gives rise to the exact secrecy-capacity characterization of a class of SD-WTCs that decompose into a product of two WTCs, one independent of the state and the other depends only on the state. The results are derived under the strict semantic-security metric that requires negligible information leakage for all message distributions.
Original language | English |
---|---|
Article number | 8894385 |
Pages (from-to) | 1497-1519 |
Number of pages | 23 |
Journal | IEEE Transactions on Information Theory |
Volume | 66 |
Issue number | 3 |
DOIs | |
State | Published - 1 Mar 2020 |
Keywords
- Channel state information
- Gelfand-Pinsker channel
- semantic-security
- soft-covering lemma
- state-dependent channel
- superposition code
- wiretap channel
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences