EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Covert Capacity-Key Tradeoff Over Discrete Memoryless Networks

Abdelaziz Bounhar, Mireille Sarkiss, Michèle Wigger

IEEE Journal on Selected Areas in Information Theory · 2026 · 7 · 323-332

DOI: 10.1109/jsait.2026.3696919 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Journal on Selected Areas in Information Theory, 2026. Verfasst von Abdelaziz Bounhar und 2 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Research Council, Agence Nationale de la Recherche.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper characterizes the covert capacity-key tradeoffs for discrete memoryless channels (DMC) and discrete memoryless multiple-access channels (DMMAC). The focus is on channels where communication rates are measured as the number of transmitted bits divided by the square-root of the blocklength and by the square-root of the covertness constraint. Previous results had determined the largest achievable covert rates for these channels, as well as the minimum key rates required to achieve these largest covert rates. In this work, we additionally determine the minimum key rates required at reduced covert rates. Stated differently, we determine the set of all covert rates that are achievable for a given set of key rates. This is termed the covert capacity-key tradeoff. Our results on the covert capacity-key tradeoffs over DMCs and DMMACs show that for small key rates and when the adversary observes the inputs through a better channel than the legitimate receiver, binary signalling at all transmitters is optimal even for larger input alphabets and the capacity-key tradeoff grows linearly. Moreover, in this regime the covert capacity-key tradeoff of DMMACs is square implying that each of the transmitters can simultaneously achieve its own largest covert rate depending only on its own available key rate, irrespective of the other transmitter. For larger key rates or when the adversary is not uniformly stronger than the legitimate receiver over all inputs, the covert capacity-key tradeoff region of DMMACs is non-square and a tradeoff arises between the rates of the various transmitters.

Förderung

  • European Research Council
  • Agence Nationale de la Recherche

Zitieren

APA

Bounhar, A., Sarkiss, M., & Wigger, M. (2026). Covert Capacity-Key Tradeoff Over Discrete Memoryless Networks. IEEE Journal on Selected Areas in Information Theory, 7, 323-332. https://doi.org/10.1109/jsait.2026.3696919

Vancouver

Bounhar A, Sarkiss M, Wigger M. Covert Capacity-Key Tradeoff Over Discrete Memoryless Networks. IEEE Journal on Selected Areas in Information Theory. 2026;7:323-332. doi:10.1109/jsait.2026.3696919

BibTeX
@article{Bounhar2026,
  author = {Bounhar, Abdelaziz and Sarkiss, Mireille and Wigger, Michèle},
  title = {Covert Capacity-Key Tradeoff Over Discrete Memoryless Networks},
  journal = {IEEE Journal on Selected Areas in Information Theory},
  year = {2026},
  volume = {7},
  pages = {323--332},
  doi = {10.1109/jsait.2026.3696919}
}
Kostenlos starten →