Capacity Bounds for Identification With Effective Secrecy

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication2023 IEEE International Symposium on Information Theory, ISIT 2023
Pages1202-1207
Number of pages6
ISBN (Electronic)9781665475549
DOIs
StatePublished - 2023
Event2023 IEEE International Symposium on Information Theory, ISIT 2023 - Taipei, Taiwan, Province of China
Duration: 25 Jun 202330 Jun 2023

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2023-June

Conference

Conference2023 IEEE International Symposium on Information Theory, ISIT 2023
Country/TerritoryTaiwan, Province of China
CityTaipei
Period25/06/2330/06/23

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Applied Mathematics
  • Modelling and Simulation

Fingerprint

Dive into the research topics of 'Capacity Bounds for Identification With Effective Secrecy'. Together they form a unique fingerprint.

Cite this