English
Related papers

Related papers: Fundamental Limits of Covert Packet Insertion

200 papers

In this work we study the problem of communication over the quantum wiretap channel. For this channel there are three parties Alice (sender), Bob (legitimate receiver) and Eve (eavesdropper). We obtain upper and lower bounds on the amount…

Quantum Physics · Physics 2017-03-07 Jaikumar Radhakrishnan , Pranab Sen , Naqueeb Ahmad Warsi

This work investigates the phase gain of intelligent reflecting surface (IRS) covert communication over complex-valued additive white Gaussian noise (AWGN) channels. The transmitter Alice intends to transmit covert messages to the…

Information Theory · Computer Science 2023-05-09 Sen Qiao , Daming Cao , Qiaosheng Zhang , Yinfei Xu , Guangjie Liu

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

Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum…

Quantum Physics · Physics 2016-08-31 André Chailloux , Gus Gutoski , Jamie Sikora

We propose the problem of wiretapped commitment, where two parties, say committer Alice and receiver Bob, engage in a commitment protocol using a noisy channel as a resource, in the presence of an eavesdropper, say Eve. Noisy versions of…

Information Theory · Computer Science 2024-06-21 Anuj Kumar Yadav , Manideep Mamindlapally , Amitalok J. Budkuley

We demonstrate the achievability of a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over the single-mode lossy bosonic channel if either the eavesdropper's measurements or…

Information Theory · Computer Science 2014-03-25 Boulat A. Bash , Saikat Guha , Dennis Goeckel , Don Towsley

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

In this paper, we study the problem of obtaining $1$-of-$2$ string oblivious transfer (OT) between users Alice and Bob, in the presence of a passive eavesdropper Eve. The resource enabling OT in our setup is a noisy broadcast channel from…

Cryptography and Security · Computer Science 2016-04-21 Manoj Mishra , Bikash Kumar Dey , Vinod M. Prabhakaran , Suhas Diggavi

We study oblivious transfer (OT) between Alice and Bob in the presence of an eavesdropper Eve over a degraded wiretapped binary erasure channel from Alice to Bob and Eve. In addition to the privacy goals of oblivious transfer between Alice…

Information Theory · Computer Science 2016-11-17 Manoj Mishra , Bikash Kumar Dey , Vinod M. Prabhakaran , Suhas Diggavi

Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest players' cheating. Finding the optimal security…

Quantum Physics · Physics 2016-03-24 André Chailloux , Iordanis Kerenidis , Jamie Sikora

We propose a covert communication protocol for the spread-spectrum multiple random access with additive white Gaussian noise (AWGN) channel. No existing paper has studied covert communication for the random access channel. Our protocol…

Information Theory · Computer Science 2023-10-25 Masahito Hayashi , Angeles Vazquez-Castro

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 communication over a channel with a causal jamming adversary subject to quadratic constraints. A sender Alice wishes to communicate a message to a receiver Bob by transmitting a real-valued length-$n$ codeword…

Information Theory · Computer Science 2018-05-10 Tongxin Li , Bikash Kumar Dey , Sidharth Jaggi , Michael Langberg , Anand D. Sarwate

Covert channel techniques are used by attackers to transfer data in a way prohibited by the security policy. There are two main categories of covert channels: timing channels and storage channels. This paper introduces a new storage channel…

Cryptography and Security · Computer Science 2011-05-17 Steffen Wendzel

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

In this paper, we study the problem of secure transmission with covert requirement in untrusted relaying networks. Our considered system model consists of one source, one destination, one untrusted relay, and one Willie. The untrusted relay…

Cryptography and Security · Computer Science 2018-09-05 Moslem Forouzesh , Paeiz Azmi , Ali Kuhestani

In this paper, we establish a framework for low probability of detection (LPD) communication from a sequential change-point detection (SCPD) perspective, where a transmitter, Alice, wants to hide her signal transmission to a receiver, Bob,…

Information Theory · Computer Science 2020-02-05 Ke-Wen Huang , Hui-Ming Wang , Don Towsley , H. Vincent Poor

We investigate the quantum-secure covert-communication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels:…

Quantum Physics · Physics 2020-09-29 Christos N. Gagatsos , Michael S. Bullock , Boulat A. Bash

This paper examines the properties of the lower and upper bounds established by Maurer, Ahlswede and Csiszar (MAC) for secret-key capacity in the case of channel probing over single-input and single-output (SISO) channels. Inspired by the…

Information Theory · Computer Science 2023-09-27 Yingbo Hua

We examine public broadcast, forward conceptual, and backward conceptual, Quantum channels in the context of communication protocols that are independent of secret keys. Given research directions of interest previously identified in arXiv:…

Quantum Physics · Physics 2025-12-24 Pete Rigas