← Lab /Security & privacy

Hybrid secret transformations make diffusion watermarks provably secure against batched detector attacks

Security & privacy Defense · Prototype · arXiv

The claim

The proposed watermarking scheme is provably secure against removal adversaries with batched detector access, matching a tight √2 noise budget bound

De Zhang Lee, Ee-Chien Chang · arXiv Paper PDF

Published as: “Provably Secure Diffusion Watermarking Against Removal Adversaries with Batched Detector Access”

So what

The work provides a watermarking construction that remains secure even when detection APIs are publicly reachable, addressing a key gap in current AI-generated content provenance defenses.

The five-minute version

The paper proves that no PPT adversary can remove the watermark with a non-negligible advantage over an isotropic white-noise attacker that has a √2-times larger perturbation budget, and that this bound is tight. It also shows that batched detector access lets an attacker recover the secret long-term transformation of prior boundary-hiding defenses, fully breaking them. The authors propose a hybrid long-term/one-time transformation scheme that achieves provable REM2 security and empirically matches unwatermarked generation quality on Stable Diffusion 2.1 and XL. Evidence comes from a 10,000-image evaluation, but the attack requires d2 samples, which may be costly in practice.

What they found 1

What undercuts it the paper’s own results

Stated limits 4

What’s new here 4

Artifacts & methods 7

Topics

latent diffusion modelsAI-generated content watermarkingremoval attackscryptographic security gamesbatched oracle accessorthonormal transformationsprovable security
← Previous LLM web agents’ success falls from 89.4% to 43.7% when facing access barriers