Identification Under the Semantic Effective Secrecy Constraint
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917936952770560 |
|---|---|
| author | Ibrahim, Abdalla Rosenberger, Johannes Bash, Boulat A. Deppe, Christian Ferrara, Roberto Pereg, Uzi |
| author_facet | Ibrahim, Abdalla Rosenberger, Johannes Bash, Boulat A. Deppe, Christian Ferrara, Roberto Pereg, Uzi |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_19142 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Identification Under the Semantic Effective Secrecy Constraint Ibrahim, Abdalla Rosenberger, Johannes Bash, Boulat A. Deppe, Christian Ferrara, Roberto Pereg, Uzi Information Theory E.4 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. |
| title | Identification Under the Semantic Effective Secrecy Constraint |
| topic | Information Theory E.4 |
| url | https://arxiv.org/abs/2502.19142 |