2020/07/06 by Xinchun Yu, Yu, Xinchun, Shuangqin Wei +3
Computer Science · Engineering · #Advanced Steganography and Watermarking Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Internet Traffic Analysis and Secure E-voting #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2007.03456
openalex publication_date 2020/07/06 · openalex created_date 2020/07/10 · openalex updated_date 2026/07/28
This paper investigates covert communication over an additive white Gaussian noise (AWGN) channel in finite block length regime on the assumption of Gaussian codebooks. We first review some achievability and converse bounds on the throughput under maximal power constraint. From these bounds and the analysis of TVD at the adversary, the first and second asymptotics of covert communication are investigated by the help of some divergences inequalities. Furthermore, the analytic solution of TVD, and approximation expansions which can be easily evaluated with given snr (signal noise ratio) are presented. In this way, the proper power level for covert communication can be approximated with given covert constraint of TVD, which leads to more accurate estimation of the power compared with preceding bounds. Further elaboration on the effect of such asymptotic characteristics on the primary channels's throughput in finite block regime is also provided. The results will be very helpful for understanding the behavior of the total variation distance and practical covert communication.