Provably Secure Covert Messaging Using Image-based Diffusion Processes

We consider the problem of securely and robustly embedding covert messages into an image-based diffusion model's output. The sender and receiver want to exchange the maximum amount of information possible per diffusion sampled image while remaining undetected. The adversary wants to detect that such communication is taking place by identifying those diffusion samples that contain covert messages. To maximize robustness to transformations of the diffusion sample, a strategy is for the sender and the receiver to embed the message in the initial latents. We first show that prior work that attempted this is easily broken because their embedding technique alters the latents' distribution. We then propose a straightforward method to embed covert messages in the initial latent {\em without} altering the distribution. We prove that our construction achieves indistinguishability to any probabilistic polynomial time adversary. Finally, we discuss and analyze empirically the tradeoffs between embedding capacity, message recovery rates, and robustness. We find that optimizing the inversion method for error correction is crucial for reliability.

@article{bauer2025_2503.10063,
  title={ Provably Secure Covert Messaging Using Image-based Diffusion Processes },
  author={ Luke A. Bauer and Wenxuan Bao and Vincent Bindschaedler },
  journal={arXiv preprint arXiv:2503.10063},
  year={ 2025 }
}