English
Related papers

Related papers: Covert Communication in Continuous-Time Systems

200 papers

Wireless short-packet communications pose challenges to the security and reliability of the transmission. Besides, the proactive warder compounds these challenges, who detects and interferes with the potential transmission. An extra jamming…

Information Theory · Computer Science 2023-08-07 Manlin Wang , Yao Yao , Bin Xia , Zhiyong Chen , Jiangzhou Wang

We consider covert communication, i.e., hiding the presence of communication from an adversary for multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channels. We characterize the maximum covert coding rate under a…

Signal Processing · Electrical Eng. & Systems 2021-01-25 Ahmed Bendary , Amr Abdelaziz , C. Emre Koksal

Secure communication with feedback is studied. An achievability scheme in which the backward channel is used to generate a shared secret key is proposed. The scenario of binary symmetric forward and backward channels is considered, and a…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , D. Richard Brown , H. Vincent Poor

This paper develops a new physical layer framework for secure two-way wireless communication in the presence of a passive eavesdropper, i.e., Eve. Our approach achieves perfect information theoretic secrecy via a novel randomized scheduling…

Information Theory · Computer Science 2009-08-27 Aly El Gamal , Moustafa Youssef , Hesham El Gamal

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

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

In this work we study the capacity of interference-limited channels with memory. These channels model non-orthogonal communications scenarios, such as the non-orthogonal multiple access (NOMA) scenario and underlay cognitive communications,…

Information Theory · Computer Science 2023-06-02 Ron Dabora , Emeka Abakasanga

This paper investigates covert communication over an additive white Gaussian noise (AWGN) channel in finite block length regime on the assumption of Gaussian codebooks. We first review some achievability and converse bounds on the…

Information Theory · Computer Science 2020-07-08 Xinchun Yu , Shuangqin Wei , Yuan Luo

In covert target detection, Alice attempts to send optical or microwave probes to determine the presence or absence of a weakly-reflecting target embedded in thermal background radiation within a target region, while striving to remain…

Quantum Physics · Physics 2024-09-12 Guo Yao Tham , Ranjith Nair , Mile Gu

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…

Information Theory · Computer Science 2023-03-22 Onur Günlü , Matthieu R. Bloch , Rafael F. Schaefer , Aylin Yener

We introduce and analyse a multiple-access channel with two senders and one receiver, in the presence of i.i.d. noise coming from the environment. Partial side information about the environmental states allows the senders to modulate their…

Information Theory · Computer Science 2020-09-25 Janis Nötzel

A user, Alice, wants to get server Bob to implement a quantum computation for her. However, she wants to leave him blind to what she's doing. What are the minimal communication resources Alice must use in order to achieve…

Quantum Physics · Physics 2025-10-21 Ethan Davies , Alastair Kay

We present a deterministic secure direct communication scheme via entanglement swapping, where a set of ordered maximally entangled three-particle states (GHZ states), initially shared by three spatially separated parties, Alice, Bob and…

Quantum Physics · Physics 2007-05-23 Ting Gao , Feng-Li Yan , Zhi-Xi Wang

We consider the scenario in which Alice transmits private classical messages to Bob via a classical-quantum channel, part of whose output is intercepted by an eavesdropper, Eve. We prove the existence of a universal coding scheme under…

Quantum Physics · Physics 2011-01-04 Nilanjana Datta , Min-Hsiu Hsieh

We study the problem of communication over an additive white Gaussian noise (AWGN) channel with an AWGN feedback channel. When the feedback channel is noiseless, the classic Schalkwijk-Kailath (S-K) scheme is known to achieve capacity in a…

Information Theory · Computer Science 2017-01-04 Assaf Ben-Yishai , Ofer Shayevitz

We consider a wiretap multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, where agent Alice aims at transmitting a secret message to agent Bob, while leaking no information on it to an eavesdropper agent Eve. We assume…

Information Theory · Computer Science 2014-04-15 Francesco Renna , Nicola Laurenti , Stefano Tomasin

Covert communications, also referred to as low probability of detection (LPD) communications, provide a higher level of privacy protection than cryptography and physical-layer security (PLS) by hiding transmissions in the ambient…

Signal Processing · Electrical Eng. & Systems 2026-04-07 Luyao Sun , Huan Huang , Yongxing Song , Zhongxing Tian , Hongliang Zhang , Weidong Mei , Dongdong Zou , Yi Cai

Given a quantum channel -- that is, a completely positive trace-preserving linear map -- as the only communication resource available between two parties, we consider the problem of characterizing the set of classical noisy channels that…

Quantum Physics · Physics 2021-05-04 Michele Dall'Arno , Sarah Brandsen , Francesco Buscemi

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at transmitter, fully or partially. However, under perfect secrecy constraint the eavesdropper may not be motivated to feedback any…

Information Theory · Computer Science 2013-07-10 Pin-Hsun Lin , Chien-Li Su , Hsuan-Jung Su

Consider a scenario where Alice wishes to send a message $m$ to Bob in a time-slotted wireless network. However, there exists an adversary, Carol, who aims to prevent the transmission of $m$ by jamming the communication channel. There is a…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-05-22 Valerie King , Seth Pettie , Jared Saia , Maxwell Young