Covert Identification over Binary-Input Memoryless Channels

07/27/2020
by   Qiaosheng Zhang, et al.
0

This paper considers the covert identification problem in which a sender aims to reliably convey an identification (ID) message to a set of receivers via a binary-input memoryless channel (BMC), and simultaneously to guarantee that the communication is covert with respect to a warden who monitors the communication via another independent BMC. We prove a square-root law for the covert identification problem. This states that an ID message of size ((Θ(√(n)))) can be transmitted over n channel uses. We then characterize the exact pre-constant in the Θ(.) notation. This constant is referred to as the covert identification capacity. We show that it equals the recently developed covert capacity in the standard covert communication problem, and somewhat surprisingly, the covert identification capacity can be achieved without any shared key between the sender and receivers. The achievability proof relies on a random coding argument with pulse-position modulation (PPM), coupled with a second stage which performs code refinements. The converse proof relies on an expurgation argument as well as results for channel resolvability with stringent input constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2021

Covert Communication With Mismatched Decoders

This paper considers the problem of covert communication with mismatched...
research
05/11/2023

Joint Identification and Sensing for Discrete Memoryless Channels

In the identification (ID) scheme proposed by Ahlswede and Dueck, the re...
research
08/28/2018

Embedding Covert Information in Broadcast Communications

We analyze a two-receiver binary-input discrete memoryless broadcast cha...
research
10/28/2021

Identification over Compound MIMO Broadcast Channels

The identification (ID) capacity region of the compound broadcast channe...
research
05/04/2021

Effects of Quantization on the Multiple-Round Secret-Key Capacity

We consider the strong secret key (SK) agreement problem for the satelli...
research
07/14/2021

Practical implementation of identification codes

Identification is a communication paradigm that promises some exponentia...
research
11/29/2018

Binary Sequence Set Design for Interferer Rejection in Multi-Branch Modulation

Wideband communication is often expected to deal with a very wide spectr...

Please sign up or login with your details

Forgot password? Click here to reset