Identification Under the Semantic Effective Secrecy Constraint

TL;DR

This paper studies secure communication over wiretap channels under semantic secrecy, deriving capacity bounds and introducing approximation-of-output statistics transmission codes, with insights into more capable channels.

Contribution

It introduces a capacity theorem for approximation-of-output statistics transmission and provides bounds for general wiretap channels under semantic secrecy.

Findings

Capacity bounds are tight for more capable wiretap channels.

Examples illustrate the bounds and gaps for different channel classes.

The semantic secrecy criterion ensures both secrecy and stealthy communication.

Abstract

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy communication. Additionally, we introduce the related problem of combining approximation-of-output statistics and transmission. We derive a capacity theorem for approximation-of-output statistics transmission codes. For a general model, we present lower and upper bounds on the capacity, showing that these bounds are tight for more capable wiretap channels. We also provide illustrative examples for more capable wiretap channels, along with examples of wiretap channel classes where a gap exists between the lower and upper bounds.