Semantically-Secured message-Key trade-Off over wiretap channels with random parameters: Invited paper

Alexander Bunin; Ziv Goldfeld; Haim H. Permuter; Shlomo Shamai Shitz; Paul Cuff; Pablo Piantanida

doi:10.1007/978-3-319-59265-7_3

Semantically-Secured message-Key trade-Off over wiretap channels with random parameters: Invited paper

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

Ben-Gurion University of the Negev, Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 2nd Workshop on Communication Security - Cryptography and Physical Layer Security
Editors	Stefano Tomasin, Marco Baldi, Elizabeth A. Quaglia
Pages	33-48
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-319-59265-7_3
State	Published - 1 Jan 2018
Event	2nd Workshop on Communication Security, WCS 2017 - Paris, France Duration: 30 Apr 2017 → 30 Apr 2017

Publication series

Name	Lecture Notes in Electrical Engineering
Volume	447

Conference

Conference	2nd Workshop on Communication Security, WCS 2017
Country/Territory	France
City	Paris
Period	30/04/17 → 30/04/17

All Science Journal Classification (ASJC) codes

Industrial and Manufacturing Engineering

Access to Document

10.1007/978-3-319-59265-7_3

Cite this

Bunin, A., Goldfeld, Z., Permuter, H. H., Shamai Shitz, S., Cuff, P., & Piantanida, P. (2018). Semantically-Secured message-Key trade-Off over wiretap channels with random parameters: Invited paper. In S. Tomasin, M. Baldi, & E. A. Quaglia (Eds.), Proceedings of the 2nd Workshop on Communication Security - Cryptography and Physical Layer Security (pp. 33-48). (Lecture Notes in Electrical Engineering; Vol. 447). https://doi.org/10.1007/978-3-319-59265-7_3

Bunin, Alexander ; Goldfeld, Ziv ; Permuter, Haim H. et al. / Semantically-Secured message-Key trade-Off over wiretap channels with random parameters : Invited paper. Proceedings of the 2nd Workshop on Communication Security - Cryptography and Physical Layer Security. editor / Stefano Tomasin ; Marco Baldi ; Elizabeth A. Quaglia. 2018. pp. 33-48 (Lecture Notes in Electrical Engineering).

@inproceedings{799eef2103be4648b65312caeeba23eb,

title = "Semantically-Secured message-Key trade-Off over wiretap channels with random parameters: Invited paper",

abstract = "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.",

author = "Alexander Bunin and Ziv Goldfeld and Permuter, {Haim H.} and {Shamai Shitz}, Shlomo and Paul Cuff and Pablo Piantanida",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2018.; 2nd Workshop on Communication Security, WCS 2017 ; Conference date: 30-04-2017 Through 30-04-2017",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-319-59265-7_3",

language = "الإنجليزيّة",

isbn = "9783319592640",

series = "Lecture Notes in Electrical Engineering",

pages = "33--48",

editor = "Stefano Tomasin and Marco Baldi and Quaglia, {Elizabeth A.}",

booktitle = "Proceedings of the 2nd Workshop on Communication Security - Cryptography and Physical Layer Security",

}

Bunin, A, Goldfeld, Z, Permuter, HH , Shamai Shitz, S, Cuff, P & Piantanida, P 2018, Semantically-Secured message-Key trade-Off over wiretap channels with random parameters: Invited paper. in S Tomasin, M Baldi & EA Quaglia (eds), Proceedings of the 2nd Workshop on Communication Security - Cryptography and Physical Layer Security. Lecture Notes in Electrical Engineering, vol. 447, pp. 33-48, 2nd Workshop on Communication Security, WCS 2017, Paris, France, 30/04/17. https://doi.org/10.1007/978-3-319-59265-7_3

Semantically-Secured message-Key trade-Off over wiretap channels with random parameters: Invited paper. / Bunin, Alexander; Goldfeld, Ziv; Permuter, Haim H. et al.
Proceedings of the 2nd Workshop on Communication Security - Cryptography and Physical Layer Security. ed. / Stefano Tomasin; Marco Baldi; Elizabeth A. Quaglia. 2018. p. 33-48 (Lecture Notes in Electrical Engineering; Vol. 447).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

PY - 2018/1/1

Y1 - 2018/1/1

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

U2 - 10.1007/978-3-319-59265-7_3

DO - 10.1007/978-3-319-59265-7_3

M3 - منشور من مؤتمر

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.

Y2 - 30 April 2017 through 30 April 2017

ER -

Bunin A, Goldfeld Z, Permuter HH , Shamai Shitz S, Cuff P, Piantanida P. Semantically-Secured message-Key trade-Off over wiretap channels with random parameters: Invited paper. In Tomasin S, Baldi M, Quaglia EA, editors, Proceedings of the 2nd Workshop on Communication Security - Cryptography and Physical Layer Security. 2018. p. 33-48. (Lecture Notes in Electrical Engineering). doi: 10.1007/978-3-319-59265-7_3

Semantically-Secured message-Key trade-Off over wiretap channels with random parameters: Invited paper

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this