Covert Identification Over Binary-Input Discrete Memoryless Channels
Covert Identification Over Binary-Input Discrete Memoryless Channels
复制标题
二进制输入离散无记忆通道上的隐蔽识别
DOI：
--
复制
发表时间：
2020
影响因子：
2.5
通讯作者：
V. Tan
中科院分区：
文献类型：
--
作者：
Q. Zhang;V. Tan
研究了隐蔽身份识别问题，发送方通过二进制离散无记忆信道（BDMC）向一组接收方可靠地传递身份信息，同时保证通信对于通过另一个独立的BDMC监视通信的管理员来说是隐蔽的.我们证明了一个平方根法的隐蔽识别问题。这表明大小为<inline-formula><tex-math notation="LaTeX">$exp（exp（Theta（sqrt { ext {n}}）$</tex-math></inline-formula>可以通过n个通道使用进行传输<italic></italic>。然后，我们在<inline-formula><tex-math notation="LaTeX">$Theta（cdot）$</tex-math></inline-formula>符号中表征精确的前常数。这个常数被称为隐性识别能力。我们表明，它等于最近开发的隐蔽容量在标准的隐蔽通信问题，有点令人惊讶的是，隐蔽的识别能力可以实现没有任何共享的发送者和接收者之间的密钥。可重复性证明依赖于具有脉冲位置调制（PPM）的随机编码参数，再加上执行代码细化的第二级。匡威的证明依赖于一个删除参数，以及严格的输入约束的通道可解析性的结果。
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 discrete memoryless channel (BDMC), and simultaneously to guarantee that the communication is covert with respect to a warden who monitors the communication via another independent BDMC. We prove a square-root law for the covert identification problem. This states that an ID message of size <inline-formula> <tex-math notation="LaTeX">$exp (exp (Theta (sqrt { ext {n}})))$ </tex-math></inline-formula> can be transmitted over <italic>n</italic> channel uses. We then characterize the exact pre-constant in the <inline-formula> <tex-math notation="LaTeX">$Theta (cdot)$ </tex-math></inline-formula> 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.
DOI：
10.1007/978-3-319-04268-8
发表时间：
2013
期刊：
Seg Technical Program Expanded Abstracts
影响因子：
--
作者：
Carles Padró
通讯作者：
Carles Padró
存在非因果信道状态信息时的无密钥隐蔽通信
DOI：
--
发表时间：
2019
期刊：
IEEE Information Theory Workshop
影响因子：
--
作者：
Zivari-Fard, H.;Bloch, M.;Nosratinia, A.
通讯作者：
Nosratinia, A.