TY - GEN
T1 - Semantically-Secured message-Key trade-Off over wiretap channels with random parameters
T2 - 2nd Workshop on Communication Security, WCS 2017
AU - Bunin, Alexander
AU - Goldfeld, Ziv
AU - Permuter, Haim H.
AU - Shamai Shitz, Shlomo
AU - Cuff, Paul
AU - Piantanida, Pablo
N1 - Publisher Copyright:
© Springer International Publishing AG 2018.
PY - 2018
Y1 - 2018
N2 - 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. Thismodel 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.
AB - 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. Thismodel 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.
UR - http://www.scopus.com/inward/record.url?scp=85026659744&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85026659744&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-59265-7_3
DO - 10.1007/978-3-319-59265-7_3
M3 - Conference contribution
AN - SCOPUS:85026659744
SN - 9783319592640
T3 - Lecture Notes in Electrical Engineering
SP - 33
EP - 48
BT - Proceedings of the 2nd Workshop on Communication Security - Cryptography and Physical Layer Security
A2 - Tomasin, Stefano
A2 - Baldi, Marco
A2 - Quaglia, Elizabeth A.
PB - Springer Verlag
Y2 - 30 April 2017 through 30 April 2017
ER -