论文标题
与反光面板完美秘密通信
Perfectly Covert Communication with a Reflective Panel
论文作者
论文摘要
这项工作考虑了无线网络中\ emph {Perfect}秘密通信的问题。具体而言，利用智能反射表面（IRS），我们将注意力转向了使发射器可以完全隐藏通信的方案，并在不需要的侦听器（Willie）上使用\ emph {Zero {Zero Energy}，因此检测率零。此类方案的应用超出了简单的秘密性，因为即使Willie已知，即使代码书，时间和频道特征是众所周知的，我们也可以防止可检测性或解码。我们定义了完美的秘密，在IRS辅助沟通中为其提供了必要和充分的条件，并定义了优化问题。对于两个IRS元素，我们分析找到解决方案并得出其封闭形式的概率。然后，我们通过分析这种零检测解决方案的概率来研究两个以上IRS元素的问题。我们证明，由于元素数量趋于无穷大，因此这种概率收敛到$ 1 $。我们提供了一种迭代算法，以找到完美的秘密解决方案并证明其收敛性。模拟还支持结果，表明少量的IRS元素允许合法用户的正率，但在不需要的侦听器中检测到零概率。
This work considers the problem of \emph{perfect} covert communication in wireless networks. Specifically, harnessing an Intelligent Reflecting Surface (IRS), we turn our attention to schemes that allow the transmitter to completely hide the communication, with \emph{zero energy} at the unwanted listener (Willie) and hence zero probability of detection. Applications of such schemes go beyond simple covertness, as we prevent detectability or decoding even when the codebook, timings, and channel characteristics are known to Willie. We define perfect covertness, give a necessary and sufficient condition for it in IRS-assisted communication, and define the optimization problem. For two IRS elements, we analyze the probability of finding a solution and derive its closed form. We then investigate the problem of more than two IRS elements by analyzing the probability of such a zero-detection solution. We prove that this probability converges to $1$ as the number of elements tends to infinity. We provide an iterative algorithm to find a perfectly covert solution and prove its convergence. The results are also supported by simulations, showing that a small amount of IRS elements allows for a positive rate at the legitimate user yet with zero probability of detection at an unwanted listener.
