English
Related papers

Related papers: Covert Communication Over a Compound Channel

200 papers

We consider the problem of covert communication over continuous-time additive white Gaussian noise (AWGN) channels under spectral mask constraints, wherein two legitimate parties attempt to communicate reliably in the presence of an…

Information Theory · Computer Science 2020-01-07 Qiaosheng , Zhang , Matthieu R. Bloch , Mayank Bakshi , Sidharth Jaggi

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals…

Information Theory · Computer Science 2016-11-18 Matthieu R. Bloch

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Keerthi S. K. Arumugam , Matthieu R. Bloch

We explore covert communication of qubits over the lossy thermal-noise bosonic channel, which is a quantum-mechanical model of many practical channels, including optical. Covert communication ensures that an adversary is unable to detect…

We extend previous results on covert communication over the additive white Gaussian noise channel to two other types of additive noise channels. The first is the Gaussian channel with memory, where the noise sequence is a Gaussian vector…

Information Theory · Computer Science 2023-03-22 Cécile Bouette , Laura Luzzi , Ligong Wang

Covert quantum communication is usually analyzed under idealized assumptions that channel parameters, such as transmissivity and background noise, are perfectly known and constant. In realistic optical links, including satellite, fiber, and…

Cryptography and Security · Computer Science 2026-04-16 Abbas Arghavani , Alessandro V. Papadopoulos , Vahid Azimi Mousolou , Giuseppe Nebbione , Shahid Raza

Encryption prevents unauthorized decoding, but does not ensure stealth---a security demand that a mere presence of a message be undetectable. We characterize the ultimate limit of covert communication that is secure against the most…

Information Theory · Computer Science 2016-08-31 Boulat A. Bash , Andrei H. Gheorghe , Monika Patel , Jonathan Habif , Dennis Goeckel , Don Towsley , Saikat Guha

The problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels is investigated, in which a transmitter attempts to reliably communicate with a legitimate receiver while avoiding…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Matthieu R. Bloch

We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

Widely-deployed encryption-based security prevents unauthorized decoding, but does not ensure undetectability of communication. However, covert, or low probability of detection/intercept (LPD/LPI) communication is crucial in many scenarios…

Information Theory · Computer Science 2015-06-02 Boulat A. Bash , Dennis Goeckel , Saikat Guha , Don Towsley

We explore covert communication of qubits over an arbitrary quantum channel. Covert communication conceals the transmissions in the channel noise, ensuring that an adversary is unable to detect their presence. We show the achievability of a…

Quantum Physics · Physics 2025-01-28 Evan J. D. Anderson , Michael S. Bullock , Filip Rozpędek , Boulat A. Bash

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the…

Information Theory · Computer Science 2010-07-01 Ashish Khisti

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…

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

We study covert communication and covert secret key generation with positive rates over quantum state-dependent channels. Specifically, we consider fully quantum state-dependent channels when the transmitter shares an entangled state with…

Information Theory · Computer Science 2025-12-01 Hassan ZivariFard , Rémi A. Chou , Xiaodong Wang

Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more…

Quantum Physics · Physics 2019-09-30 Stefano Pirandola

Semantic communication is a new paradigm for information transmission that integrates the essential meaning (semantics) of the message into the communication process. However, like in classic wireless communications, the open nature of…

Information Theory · Computer Science 2024-10-22 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

We study covert classical communication over a quantum multiple-access channel (MAC) with a helper. Specifically, we consider three transmitters, where one transmitter helps the other two transmitters communicate covertly with a receiver.…

Information Theory · Computer Science 2025-12-03 Hassan ZivariFard , Rémi A. Chou , Xiaodong Wang

Compound channel models offer a simple and straightforward way of analyzing the stability of decoder design under model variations. With this work we provide a coding theorem for a large class of practically relevant compound channel…

Information Theory · Computer Science 2021-05-11 Andrea Cacioppo , Janis Nötzel , Matteo Rosati