Chainwash: Multi-Step Rewriting Attacks on Diffusion Language Model Watermarks
On the map: Diffusion models → Robustness, privacy and adversarial aspects
also in 1 more
Abstract (arXiv)
Statistical watermarking is a common approach for verifying whether text was written by a language model. Most existing schemes assume autoregressive generation, where tokens are produced left to right and contextual hashing is well defined. Diffusion language models generate text by denoising tokens in arbitrary order, so these schemes cannot be applied directly. A recent watermark by Gloaguen et al. addresses this gap for LLaDA 8B Instruct and reports true positive detection above 99%. This paper studies what happens when watermarked text is rewritten not once but several times. Using the same watermark configuration, 1,605 watermarked completions of about 300 tokens each are produced across five WaterBench domains. Each completion is rewritten by four open weight language models, from 1.5B to 8B parameters, none of which know the watermark key. Five rewrite styles are tested: paraphrase, humanize, simplify, academic, and summarize expand. Each style is chained for up to five hops, producing 160,500 rewritten texts in total. The watermark is detected on 87.9% of the original outputs at the standard significance threshold. After a single rewrite, detection falls to between 14% and 41% depending on the rewriter and style. After five chained rewrites, detection falls to 4.86%, meaning 94.76% of the originally detected texts are no longer flagged. After three rewrites, the detector score has dropped 86% of the way from its watermarked baseline toward the null distribution. Repeated rewriting is therefore a much stronger attack than a single rewrite, and the result holds across all four rewriters tested.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Robustness, privacy and adversarial aspects, one of 14 directions in Diffusion models. Builds on 15 of its 18 references that are in the map. First posted on arXiv 6 May 2026.
Builds on
15 of 18 references.
Closest ancestors · 2
Same direction, newest first
- 2025Watermarking Discrete Diffusion Language Models3 Nov
- 2025Watermarking Diffusion Language Models29 Sep
Other references · 13
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2021Structured Denoising Diffusion Models in Discrete State-Spacescited by 1,665
- 2023Discrete Diffusion Modeling by Estimating the Ratios of the Data Distributioncited by 712
- 2023A Watermark for Large Language Modelscited by 667
- 2023Paraphrasing evades detectors of AI-generated text, but retrieval is an effective defensecited by 401
- 2023Can AI-Generated Text be Reliably Detected?cited by 372
- 2023Robust Distortion-free Watermarks for Language Modelscited by 279
- 2023Provable Robust Watermarking for AI-Generated Textcited by 259
- 2023The Science of Detecting LLM-Generated Textscited by 126
- 2023A Survey on LLM-Generated Text Detection: Necessity, Methods, and Future Directionscited by 101
- 2023Mark My Words: Analyzing and Evaluating Language Model Watermarkscited by 62
- 2023WaterBench: Towards Holistic Evaluation of Watermarks for Large Language Modelscited by 27
1 more
- 2024A Watermark for Order-Agnostic Language Modelscited by 14
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Global Sketch-Based Watermarking for Diffusion Language Models
- 2026dgMARK: Decoding-Guided Watermarking for Diffusion Language Models
- 2026TANGO: Watermarking Masked Diffusion Language Models in Token Pairs
- 2026Improving the Trade-off Between Watermark Strength and Speculative Sampling Efficiency for Language Models
- 2026LR-DWM: Efficient Watermarking for Diffusion Language Models
- 2025StealthInk: A Multi-bit and Stealthy Watermark for Large Language Models
- 2025Autoregressive Images Watermarking through Lexical Biasing: An Approach Resistant to Regeneration Attack
- 2025How Good is Post-Hoc Watermarking With Language Model Rephrasing?