Semantically-Secured message-key trade-off over wiretap channels with random parameters

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

1 L2S - Laboratoire des signaux et systèmes
2 EE-Technion - Department of Electrical Engineering - Technion [Haïfa]

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 all other instances of CSI availability as special cases, and calls for an efficient utilization of the state sequence both for reliability and security purposes. An inner bound on the semantic-security (SS) SM-SK capacity region is derived based on a novel superposition coding scheme. Our inner bound improves upon the previously best known SM-SK trade-off result 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. The results are derived under the strict semantic-security metric that requires negligible information leakage for all message-key distributions. The achievability proof uses the strong soft-covering lemma for superposition codes.

Domains: Computer Science [cs]; Information Theory [cs.IT]; Computer Science [cs]; Networking and Internet Architecture [cs.NI]; Mathematics [math]; Information Theory [math.IT]; Mathematics [math]; Statistics [math.ST]

Pablo Piantanida, Alexander Bunin, Ziv Goldfeld, Haim H. Permuter, Shlomo Shamai Shitz, et al.. Semantically-Secured message-key trade-off over wiretap channels with random parameters. Proceedings of the 2nd Workshop on Communication Security, May 2017, Paris, France. ⟨10.1007/978-3-319-59265-7_3⟩. ⟨hal-01742455⟩