OWF ⇒ Watermarking

Standard model · CGZ24

Statement

If one-way functions exist, there is a watermarking scheme that, for every language model whose responses have length at most , is undetectable: without the secret key, polynomially many responses to adaptively chosen prompts are computationally indistinguishable from the model’s own outputs; -complete for some , so the probability that a watermarked response has empirical entropy at least yet is not detected is negligible; and sound, so every text of length at most fixed independently of the key is detected with negligible probability over the choice of key — CGZ24 (Theorem 1).

Notes