Covert Communication Over a K -User Multiple-Access Channel

DOI10.1109/TIT.2019.2930484MaRDI QIDQ5211489zbMATH OpenFDO

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.06007

discrete memoryless multiple-access channel (MAC)

Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40) Cryptography (94A60)

Abstract: We consider a scenario in which

K

transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless MAC. We assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver. We show that each of the

K

transmitters can transmit on the order of

s q r t n

reliable and covert bits per

n

channel uses, exceeding which, the warden will be able to detect the communication. We identify the optimal pre-constants of the scaling, which leads to a complete characterization of the covert capacity region of the

K

-user binary-input MAC. We show that, asymptotically, all sum-rate constraints are inactive unlike the traditional MAC capacity region. We also characterize the channel conditions that have to be satisfied for the transmitters to operate without a secret key.

Cited in

(3)

This page was built for publication: Covert Communication Over a $K$ -User Multiple-Access Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211489)