Key and Message Semantic-Security Over State-Dependent Channels

Alexander Bunin (1) , Ziv Goldfeld (2) , Haim H Permuter (3) , Shlomo Shamai Shitz (1) , Paul Cuff (4) , Pablo Piantanida (5)

1 Technion - Israel Institute of Technology [Haifa]
2 EECS - Department of Electrical Engineering and Computer Science
3 BGU - Ben-Gurion University of the Negev
4 Princeton University
5 L2S - Laboratoire des signaux et systèmes

We study the trade-off between secret message (SM) and secret key (SK) rates, simultaneously achievable over a state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes other instances of CSI availability as special cases, and calls for efficient utilization of the state sequence for both reliability and security purposes. An inner bound on the semantic-security (SS) SM-SK capacity region is derived based on a superposition coding scheme inspired by a past work of the authors. The region is shown to attain capacity for a certain class of SD-WTCs. SS is established by virtue of two versions of the strong soft-covering lemma. The derived region yields an improvement upon the previously best known SM-SK trade-off result reported by Prabhakaran et al., and, to the best of our knowledge, upon all other existing lower bounds for either SM or SK for this setup, even if the semantic security requirement is relaxed to weak secrecy. It is demonstrated that our region can be strictly larger than those reported in the preceding works.

Domains: Computer Science [cs]; Cryptography and Security [cs.CR]

Alexander Bunin, Ziv Goldfeld, Haim H Permuter, Shlomo Shamai Shitz, Paul Cuff, et al.. Key and Message Semantic-Security Over State-Dependent Channels. IEEE Transactions on Information Forensics and Security, 2020, 15, pp.1541-1556. ⟨10.1109/TIFS.2018.2853108⟩. ⟨hal-02944052⟩