Keyless covert communication over Multiple-Access Channels
- 11 August 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2229-2233
Abstract
We consider a scenario in which two legitimate transmitters attempt to communicate with a legitimate receiver over a discrete memoryless Multiple-Access Channel (MAC), while escaping detection from an adversary who observes their communication through another discrete memoryless MAC. If the MAC to the legitimate receiver is “better” than the one to the adversary, in a sense that we make precise, then the legitimate users can reliably communicate on the order of √n bits per n channel uses with arbitrarily Low Probability of Detection (LPD) without using a secret key. We also identify the pre-constants of the scaling, which leads to a characterization of the covert capacity region.Keywords
This publication has 7 references indexed in Scilit:
- Covert Communication Over Noisy Channels: A Resolvability PerspectiveIEEE Transactions on Information Theory, 2016
- Limits of low-probability-of-detection communication over a discrete memoryless channel2015
- A channel resolvability perspective on stealth communications2015
- Limits of Reliable Communication with Low Probability of Detection on AWGN ChannelsIEEE Journal on Selected Areas in Communications, 2013
- Reliable deniable communication: Hiding messages in noise2013
- Multiple Access Wiretap channels with strong secrecy2010
- Resolvability theory for the multiple-access channelIEEE Transactions on Information Theory, 1998