English
Related papers

Related papers: Covert Wireless Communication with Artificial Nois…

200 papers

In this paper, we investigate the optimal design of a wireless-powered covert communication (WP-CC) system, in which a probabilistic accumulate-then-transmit (ATT) protocol is proposed to maximize the communication covertness subject to a…

Information Theory · Computer Science 2021-04-14 Yida Wang , Shihao Yan , Weiwei Yang , Caijun Zhong , Derrick Wing Kwan Ng

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 oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the…

Information Theory · Computer Science 2014-04-29 Manoj Mishra , Bikash Kumar Dey , Vinod M. Prabhakaran , Suhas Diggavi

We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy…

Information Theory · Computer Science 2016-11-15 Frédérique Oggier , Patrick Solé , Jean-Claude Belfiore

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

We explore covert entanglement generation over the lossy thermal-noise bosonic channel, which is a quantum-mechanical model of many practical settings, including optical, microwave, and radio-frequency (RF) channels. Covert communication…

We study quantum communication in the presence of adversarial noise. In this setting, communicating with perfect fidelity requires using a quantum code of bounded minimum distance, for which the best known rates are given by the quantum…

Quantum Physics · Physics 2008-01-28 Debbie Leung , Graeme Smith

In this paper, the compression of an independent and identically distributed Gaussian source sequence is studied in an unsecure network. Within a game theoretic setting for a three-party noiseless communication network (sender Alice,…

Cryptography and Security · Computer Science 2013-07-30 Eva C. Song , Paul Cuff , H. Vincent Poor

In this paper, we consider covert beamforming design for intelligent reflecting surface (IRS) assisted Internet of Things (IoT) networks, where Alice utilizes IRS to covertly transmit a message to Bob without being recognized by Willie. We…

Information Theory · Computer Science 2021-09-02 Shuai Ma , Yunqi Zhang , Hang Li , Junchang Sun , Jia Shi , Han Zhang , Chao Shen , Shiyin Li

Bosonic quantum communication has extensively been analysed in the asymptotic setting, assuming infinite channel uses and vanishing communication errors. Comparatively fewer detailed analyses are available in the non-asymptotic setting,…

Quantum Physics · Physics 2025-03-06 Francesco Anna Mele , Giovanni Barbarino , Vittorio Giovannetti , Marco Fanizza

Movable antenna (MA) technology is highly promising for improving communication performance, due to its advantage of flexibly adjusting positions of antennas to reconfigure channel conditions. In this paper, we investigate MAs-assisted…

Information Theory · Computer Science 2024-04-05 Guojie Hu , Qingqing Wu , Donghui Xu , Kui Xu , Jiangbo Si , Yunlong Cai , Naofal Al-Dhahir

Covert communications provide a stronger privacy protection than cryptography and physical-layer security (PLS). However, previous works on covert communications have implicitly assumed the validity of channel reciprocity, i.e., wireless…

Signal Processing · Electrical Eng. & Systems 2025-09-03 Huan Huang , Hongliang Zhang , Yi Cai , Dusit Niyato , A. Lee Swindlehurst , Zhu Han

We propose a new adversarial attack on frequency-hopping based wireless communication between two users, namely Alice and Bob. In this attack, the adversary, referred to as Eve, instantaneously modifies the transmitted signal by Alice…

Information Theory · Computer Science 2019-03-28 J. Harshan , Yih-Chun Hu

We present the design of a new passive wireless communication system that does not rely on ambient or generated RF sources. Instead, we exploit the Johnson (thermal) noise generated by a resistor to transmit information bits wirelessly. By…

Networking and Internet Architecture · Computer Science 2022-12-28 Zerina Kapetanovic , Miguel Morales , Joshua R. Smith

We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission…

Quantum Physics · Physics 2026-05-27 Ohad Kimelfeld , Boulat A. Bash , Uzi Pereg

Wyner's elegant model of wiretap channel exploits noise in the communication channel to provide perfect secrecy against a computationally unlimited eavesdropper without requiring a shared key. We consider an adversarial model of wiretap…

Cryptography and Security · Computer Science 2015-04-22 Pengwei Wang , Reihaneh Safavi-Naini

In this paper, we consider the issue of covert communications with random access protocol. We consider that the legitimate user Bob has no priori knowledge about packet arrival time and thus employs data-aided frame detection based on…

Information Theory · Computer Science 2019-07-18 Weile Zhang , Nan Zhao , Shun Zhang , F. Richard Yu

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

Information Theory · Computer Science 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

We consider the problem of computing a $(1+\epsilon)$-approximation of the Hamming distance between a pattern of length $n$ and successive substrings of a stream. We first look at the one-way randomised communication complexity of this…

Data Structures and Algorithms · Computer Science 2016-02-24 Raphael Clifford , Tatiana Starikovskaya

We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…

Information Theory · Computer Science 2011-08-09 Urs Niesen
‹ Prev 1 8 9 10 Next ›