DeepAI AI Chat
Log In Sign Up

State Masking Over a Two-State Compound Channel

by   Sadaf Salehkalaibar, et al.

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 transmitter wishes to communicate to legitimate receiver(s) while ensuring that the communication is not detected by an adversary. The main contribution in our two-state masking setup is the establishment of bounds on the throughput-key region when the constraint that quantifies how much the states are masked is defined to be the total variation distance between the two channel-induced distributions. For the scenario in which the key length is infinite, we provide sufficient conditions for when the bounds to coincide for the throughput, which follows the square-root law. Numerical examples, including that of a Gaussian channel, are provided to illustrate our results.


page 1

page 2

page 3

page 4


Covert Communication Over a Compound Channel

In this paper, we consider fundamental communication limits over a compo...

Keyless Covert Communication via Channel State Information

We consider the problem of covert communication over a state-dependent c...

Time-Division Transmission is Optimal for Covert Communication over Broadcast Channels

We consider a covert communication scenario where a legitimate transmitt...

Learning an Adversary's Actions for Secret Communication

Secure communication over a wiretap channel is investigated, in which an...

The Sound and the Fury: Hiding Communications in Noisy Wireless Networks with Interference Uncertainty

Covert communication can prevent the opponent from knowing that a wirele...

On Reverse Elastic Channels and the Asymmetry of Commitment Capacity under Channel Elasticity

Commitment is an important cryptographic primitive. It is well known tha...