Covert communication limits tightened with refined analysis over channels
Exact Second-Order Asymptotics in Covert Communication Over Discrete Memoryless Channels
Information Theory
Summary
Sending secret messages without being detected is very tricky. Previous research had a good estimate of how many secret bits could be sent and a rough idea about the details, but there was some guesswork left. The authors found a better way to measure the risk of detection by focusing on how closely the hidden message’s output looks like normal output, using smarter math. This sharper approach removed earlier uncertainties and gave an exact answer about how many secret bits can be sent safely for a given message length.
What this means in practice
- •For communication system engineers: Design reliable and tightly provable covert communication protocols with exact performance guarantees over noisy channels.
- •For security protocol developers: Build communication systems that minimize detection risk with precise bounds on covertness for sensitive data exchange.
A theory result. No direct application yet.
Authors
Qiaosheng Zhang, Lin Zhou, Xuelong Li
Abstract
We determine the exact second-order asymptotics of covert communication over binary-input discrete memoryless channels when covertness is measured by variational distance. Previous work by Tahmasbi and Bloch [IEEE Trans. Inf. Theory, Apr. 2019] characterized the first-order asymptotics and derived achievability and converse bounds on the second-order term, but these bounds do not match. The gap arises from an additional penalty of order \(n^{1/4}\) in the achievability bound. We show that this penalty can be removed through a sharper analysis of the distribution of the warden's output induced by pulse-position modulation. Specifically, we express the variational distance through the Bhattacharyya coefficient of two distributions and the expectation of a continuous function of the log-likelihood ratio. Because the resulting expectation involves a continuous function rather than the probability of a likelihood-ratio event, an analysis of the characteristic function combined with a Gaussian smoothing argument reduces the approximation error from \(O(n^{-1/4})\) (derived from the Berry--Esseen bound in prior work) to \(O(n^{-1/2})\). With this better controlled approximation error, we manage to derive a matching achievability result to the existing converse result, thus establishing the exact second-order asymptotics.