Covert Multi-Access Communication with a Non-Covert User
Abstract: In this paper, we characterize the fundamental limits of a communication system with three users (i.e., three transmitters) and a single receiver where communication from two covert users must remain undetectable to an external warden. Our results show a tradeoff between the highest rates that are simultaneously achievable for the three users. They further show that the presence of a non-covert user in the system can enhance the capacities of the covert users under stringent secret-key constraints. To derive our fundamental limits, we provide an information-theoretic converse proof and present a coding scheme that achieves the performance of our converse result. Our coding scheme is based on multiplexing different code phases, which seems to be essential to exhaust the entire tradeoff region between the rates at the covert and the two non-covert users. This property is reminiscent of the setup with multiple non-covert users, where multiplexing is also required to exhaust the entire rate-region.
- V. Hassija, V. Chamola, V. Saxena, D. Jain, P. Goyal, and B. Sikdar, “A survey on iot security: Application areas, security threats, and solution architectures,” IEEE Access, vol. 7, pp. 82 721–82 743, 2019.
- B. A. Bash, D. Goeckel, and D. Towsley, “Limits of reliable communication with low probability of detection on awgn channels,” IEEE Journal on Selected Areas in Communications, vol. 31, no. 9, pp. 1921–1930, 2013.
- B. A. Bash, D. Goeckel, D. Towsley, and S. Guha, “Hiding information in noise: fundamental limits of covert wireless communication,” IEEE Communications Magazine, vol. 53, no. 12, pp. 26–31, 2015.
- M. R. Bloch, “Covert communication over noisy channels: A resolvability perspective,” IEEE Transactions on Information Theory, vol. 62, no. 5, pp. 2334–2354, 2016.
- L. Wang, G. W. Wornell, and L. Zheng, “Fundamental limits of communication with low probability of detection,” IEEE Transactions on Information Theory, vol. 62, no. 6, pp. 3493–3503, 2016.
- K. S. Kumar Arumugam and M. R. Bloch, “Embedding covert information in broadcast communications,” IEEE Transactions on Information Forensics and Security, vol. 14, no. 10, pp. 2787–2801, 2019.
- D. Kibloff, S. M. Perlaza, and L. Wang, “Embedding covert information on a given broadcast code,” in 2019 IEEE International Symposium on Information Theory (ISIT), 2019, pp. 2169–2173.
- S. W. Kim and H. Q. Ta, “Covert communications over multiple overt channels,” IEEE Transactions on Communications, vol. 70, no. 2, pp. 1112–1124, 2022.
- A. Bounhar, M. Sarkiss, and M. Wigger, “Mixing a covert and a non-covert user,” in 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 2577–2582.
- K. S. K. Arumugam and M. R. Bloch, “Covert communication over a k𝑘kitalic_k -user multiple-access channel,” IEEE Transactions on Information Theory, vol. 65, no. 11, pp. 7020–7044, 2019.
- K.-H. Cho and S.-H. Lee, “Treating interference as noise is optimal for covert communication over interference channels,” IEEE Transactions on Information Forensics and Security, vol. 16, pp. 322–332, 2021.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.