FINDING · DEFENSE
Discop achieves provably perfect steganographic security (DKL(Pc‖Ps) = 0) by constructing multiple 'distribution copies' of a generative model's predicted distribution and using the copy index to encode the secret message. Because all copies share identical token probabilities, the stego distribution is exactly equal to the cover distribution and no steganalyzer can perform better than random guessing.
From 2023-ding-discop — Discop: Provably secure steganography in practice based on ``distribution copies'' · §III · 2023 · Symposium on Security \& Privacy
Implications
- Build covert channels on top of explicit generative models (LLMs, autoregressive image/speech models) using distribution-copy steganography rather than payload replacement or distribution-modifying arithmetic coding — this provides information-theoretic undetectability rather than empirical hardness.
- The only shared secret required is a PRNG seed and an agreed generative model checkpoint; no per-channel or per-session protocol negotiation is needed beyond the symmetric key.
Tags
Extracted by claude-sonnet-4-6 — review before relying.