English
Related papers

Related papers: Covert Communication Over a Compound Channel

200 papers

We consider fundamental limits for communicating over a compound channel when the state of the channel needs to be masked. Our model is closely related to an area of study known as covert communication that is a setting in which the…

Information Theory · Computer Science 2020-12-04 Sadaf Salehkalaibar , Mohammad Hossein Yassaee , Vincent Y. F. Tan , Mehrasa Ahmadipour

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and…

Information Theory · Computer Science 2025-09-29 Amir Reza Ramtin , Dennis Goeckel , Don Towsley

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

We study the fundamental limits of covert communications over general memoryless additive-noise channels. We assume that the legitimate receiver and the eavesdropper share the same channel and therefore see the same outputs. Under mild…

Information Theory · Computer Science 2024-12-24 Cécile Bouette , Laura Luzzi , Ligong Wang

The fundamental limit of Semantic Communications (joint source-channel coding) is established when the transmission needs to be kept covert from an external warden. We derive information-theoretic achievability and matching converse results…

Information Theory · Computer Science 2024-06-21 Abdelaziz Bounhar , Mireille Sarkiss , Michèle Wigger

Covert communication allows us to transmit messages in such a way that it is not possible to detect that the communication is occurring. This provides protection in situations where knowledge that people are talking to each other may be…

Quantum Physics · Physics 2018-02-28 Juan Miguel Arrazola , Ryan Amiri

This paper considers the problem of covert communication with mismatched decoding, in which a sender wishes to reliably communicate with a receiver whose decoder is fixed and possibly sub-optimal, and simultaneously to ensure that the…

Information Theory · Computer Science 2021-11-11 Qiaosheng Zhang , Vincent Y. F. Tan

Covert communication hides the transmission of a message from a watchful adversary while ensuring reliable information decoding at the receiver, providing enhanced security in wireless communications. In this letter, covert communication in…

Information Theory · Computer Science 2019-10-17 Khurram Shahzad , Xiangyun Zhou , Shihao Yan

We consider the problem of covert communication over a state-dependent channel when the channel state is available either non-causally, causally, or strictly causally, either at the transmitter alone or at both transmitter and receiver.…

Information Theory · Computer Science 2021-05-24 Hassan ZivariFard , Matthieu R. Bloch , Aria Nosratinia

Covert communication aims to shield the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, for the first time we examine the possibility and achievable performance of covert…

Information Theory · Computer Science 2017-04-18 Jinsong Hu , Shihao Yan , Xiangyun Zhou , Feng Shu , Jiangzhou Wang

Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication…

Information Theory · Computer Science 2017-02-01 Shihao Yan , Biao He , Yirui Cong , Xiangyun Zhou

A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate…

Information Theory · Computer Science 2017-03-08 Khurram Shahzad , Xiangyun Zhou , Shihao Yan

This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn whether the legitimate parties are using the…

Information Theory · Computer Science 2017-03-08 Ligong Wang

Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and…

Information Theory · Computer Science 2021-06-25 Qiaosheng Zhang , Mayank Bakshi , Sidharth Jaggi

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…

Information Theory · Computer Science 2019-06-11 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

We study covert communications over binary-input discrete memoryless alarm two-way channels, in which two users interact through a two-way channel and attempt to hide the presence of their communication from an eavesdropping receiver. The…

Information Theory · Computer Science 2025-06-23 Tuna Erdoğan , Tyler Kann , Aria Nosratinia , Matthieu Bloch

In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…

Information Theory · Computer Science 2016-11-17 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

Covert communication offers a method to transmit messages in such a way that it is not possible to detect that the communication is happening at all. In this work, we report an experimental demonstration of covert communication that is…

Wireless covert channels promise to exfiltrate information with high bandwidth by circumventing traditional access control mechanisms. Ideally, they are only accessible by the intended recipient and---for regular system…

Networking and Internet Architecture · Computer Science 2015-05-06 Jiska Classen , Matthias Schulz , Matthias Hollick

Fundamental limits of covert communication have been studied in literature for different models of scalar channels. It was shown that, over $n$ independent channel uses, $\mathcal{O}(\sqrt{n})$ bits can transmitted reliably over a public…

Information Theory · Computer Science 2018-03-15 Amr Abdelaziz , C. Emre Koksal
‹ Prev 1 2 3 10 Next ›