Capacity Bounds for Identification With Effective Secrecy
Information Theory
2023-06-27 v1 math.IT
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.
Cite
@article{arxiv.2306.14792,
title = {Capacity Bounds for Identification With Effective Secrecy},
author = {Johannes Rosenberger and Abdalla Ibrahim and Boulat A. Bash and Christian Deppe and Roberto Ferrara and Uzi Pereg},
journal= {arXiv preprint arXiv:2306.14792},
year = {2023}
}
Comments
ISIT 2023 version