Capacity Bounds for Identification With Effective Secrecy

Johannes Rosenberger; Abdalla Ibrahim; Boulat A. Bash; Christian Deppe; Roberto Ferrara; Uzi Pereg

doi:10.1109/ISIT54713.2023.10206589

Capacity Bounds for Identification With Effective Secrecy

Johannes Rosenberger, Abdalla Ibrahim, Boulat A. Bash, Christian Deppe, Roberto Ferrara, Uzi Pereg

Electrical and Computer Engineering

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

Abstract

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound is improved by applying it to a prefix channel, formed by concatenating an auxiliary channel and the actual channel. The bounds are tight if the legitimate channel is more capable than the eavesdropper's channel. An illustrative example is provided for a wiretap channel that is composed of a point-to-point channel, and a parallel, reversely degraded wiretap channel. A comparison with results for message transmission and for identification with only secrecy constraint is provided.

Original language	English (US)
Title of host publication	2023 IEEE International Symposium on Information Theory, ISIT 2023
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1202-1207
Number of pages	6
ISBN (Electronic)	9781665475549
DOIs	https://doi.org/10.1109/ISIT54713.2023.10206589
State	Published - 2023
Event	2023 IEEE International Symposium on Information Theory, ISIT 2023 - Taipei, Taiwan, Province of China Duration: Jun 25 2023 → Jun 30 2023

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2023-June
ISSN (Print)	2157-8095

Conference

Conference	2023 IEEE International Symposium on Information Theory, ISIT 2023
Country/Territory	Taiwan, Province of China
City	Taipei
Period	6/25/23 → 6/30/23

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT54713.2023.10206589

Cite this

Rosenberger, J., Ibrahim, A., Bash, B. A., Deppe, C., Ferrara, R., & Pereg, U. (2023). Capacity Bounds for Identification With Effective Secrecy. In 2023 IEEE International Symposium on Information Theory, ISIT 2023 (pp. 1202-1207). (IEEE International Symposium on Information Theory - Proceedings; Vol. 2023-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT54713.2023.10206589

Capacity Bounds for Identification With Effective Secrecy. / Rosenberger, Johannes; Ibrahim, Abdalla; Bash, Boulat A. et al.
2023 IEEE International Symposium on Information Theory, ISIT 2023. Institute of Electrical and Electronics Engineers Inc., 2023. p. 1202-1207 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2023-June).

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

Rosenberger, J, Ibrahim, A, Bash, BA, Deppe, C, Ferrara, R & Pereg, U 2023, Capacity Bounds for Identification With Effective Secrecy. in 2023 IEEE International Symposium on Information Theory, ISIT 2023. IEEE International Symposium on Information Theory - Proceedings, vol. 2023-June, Institute of Electrical and Electronics Engineers Inc., pp. 1202-1207, 2023 IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, Province of China, 6/25/23. https://doi.org/10.1109/ISIT54713.2023.10206589

Rosenberger J, Ibrahim A, Bash BA, Deppe C, Ferrara R, Pereg U. Capacity Bounds for Identification With Effective Secrecy. In 2023 IEEE International Symposium on Information Theory, ISIT 2023. Institute of Electrical and Electronics Engineers Inc. 2023. p. 1202-1207. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT54713.2023.10206589

@inproceedings{da93052d842e4b52b1cdee7be17292e8,

title = "Capacity Bounds for Identification With Effective Secrecy",

abstract = "An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound is improved by applying it to a prefix channel, formed by concatenating an auxiliary channel and the actual channel. The bounds are tight if the legitimate channel is more capable than the eavesdropper's channel. An illustrative example is provided for a wiretap channel that is composed of a point-to-point channel, and a parallel, reversely degraded wiretap channel. A comparison with results for message transmission and for identification with only secrecy constraint is provided.",

author = "Johannes Rosenberger and Abdalla Ibrahim and Bash, {Boulat A.} and Christian Deppe and Roberto Ferrara and Uzi Pereg",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 2023 IEEE International Symposium on Information Theory, ISIT 2023 ; Conference date: 25-06-2023 Through 30-06-2023",

year = "2023",

doi = "10.1109/ISIT54713.2023.10206589",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1202--1207",

booktitle = "2023 IEEE International Symposium on Information Theory, ISIT 2023",

}

TY - GEN

T1 - Capacity Bounds for Identification With Effective Secrecy

AU - Rosenberger, Johannes

AU - Ibrahim, Abdalla

AU - Bash, Boulat A.

AU - Deppe, Christian

AU - Ferrara, Roberto

AU - Pereg, Uzi

PY - 2023

Y1 - 2023

N2 - An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound is improved by applying it to a prefix channel, formed by concatenating an auxiliary channel and the actual channel. The bounds are tight if the legitimate channel is more capable than the eavesdropper's channel. An illustrative example is provided for a wiretap channel that is composed of a point-to-point channel, and a parallel, reversely degraded wiretap channel. A comparison with results for message transmission and for identification with only secrecy constraint is provided.

AB - An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound is improved by applying it to a prefix channel, formed by concatenating an auxiliary channel and the actual channel. The bounds are tight if the legitimate channel is more capable than the eavesdropper's channel. An illustrative example is provided for a wiretap channel that is composed of a point-to-point channel, and a parallel, reversely degraded wiretap channel. A comparison with results for message transmission and for identification with only secrecy constraint is provided.

UR - http://www.scopus.com/inward/record.url?scp=85171437700&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85171437700&partnerID=8YFLogxK

U2 - 10.1109/ISIT54713.2023.10206589

DO - 10.1109/ISIT54713.2023.10206589

M3 - Conference contribution

AN - SCOPUS:85171437700

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1202

EP - 1207

BT - 2023 IEEE International Symposium on Information Theory, ISIT 2023

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2023 IEEE International Symposium on Information Theory, ISIT 2023

Y2 - 25 June 2023 through 30 June 2023

ER -

Capacity Bounds for Identification With Effective Secrecy

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this