- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors of the paper introduce Dandelion, a fragile watermark for blockwise masked diffusion language generation.
Dandelion works as follows: after completing each block, it selects reconstructible carrier positions outside designated exact-content regions, computes a keyed tag from the remaining payload and preceding chain state, and substitutes high-probability carrier tokens that encode the required bits. The next chain state commits both the tag and realized carriers, making earlier modifications affect later checks. Detection requires the text, tokenizer, key, and shared configuration, but not the generation model or original output. The authors of the paper prove conditional completeness and tamper-sensitivity results and evaluate six MDLM backbones on HC3 prompts, including perturbation detection, unwatermarked controls, quality measures, and runtime.
Critical strengths
(1) The construction provides a nice approach to text-only verification of blockwise generated content: Separating payload tokens from carriers avoids direct circularity in tag construction and the process of committing realized carrier identities into the subsequent state makes earlier carrier changes propagate through the chain. Deterministic carrier reconstruction and serialization checks address practical obstacles to detecting from received text without storing the original generation. I believe that these are useful design choices for fragile watermarking.
(2) The paper evaluates more than intact-output detection: It reports perturbation results across six MDLM backbones, varies block sizes and output lengths, and separately evaluates naturally unwatermarked controls. The difference between tamper detection and accidental acceptance of unwatermarked text seems valuable. The appendix also identifies the final-block boundary and tokenization-equivalent edits, helping explain what the detector actually authenticates.
Critical weaknesses
(1) The protection against consequential localized edits is too weak to fully support the integrity motivation: Corollary 6 and Appendix G acknowledge that changing one final-block carrier can pass verification with probability . A final-block payload modification with four reconstructed carriers has only a false-acceptance bound. Since carrier locations are publicly reconstructible, choosing a vulnerable location does not require knowing the key. A final block can contain a fact, negation, or conclusion, so this is consequential even if the aggregate TNR over sampled perturbations exceeds 99%. I appreciate that Appendix G explicitly limits the method to a lightweight tamper-detection signal and does not claim general cryptographic authentication. Nevertheless, the aggregate metric provides limited evidence of protection for the localized edits that most challenge the paper’s integrity use case.
(2) The efficiency and embedding-availability evaluation does not cover important operating conditions. Page 8 states that the sampler reveals one token per denoising step, and Appendix E measures the reported 5.42% overhead under those same settings. Appendix B adds one model-scoring call per carrier, so those calls can represent a substantially larger fraction of generation time under a genuinely parallel reveal schedule. The construction is structurally compatible with such schedules, but low overhead there is not tested. In addition, embedding fails if any nonempty block lacks an eligible carrier outside the excluded code/math regions. A complete block inside a sufficiently long fenced-code region therefore causes failure. The paper does not report embedding success, abort, repair, and retry rates across all attempted outputs in such settings. The 100% intact TPR is conditional on successful embedding and self-verification, and the reported successful-output metrics do not resolve availability.
Questions for authors
(0) The authors discuss some related works on watermarking of discrete diffusion. But there's one work that has pretty good empirical evaluation and that does not have hyperparameter tuning. Can the authors compare to [1]?
(1) Perturbation evaluation: Please specify how many tokens each perturbation changes and how locations are sampled. Can the existing results be stratified into earlier-block edits, final-block payload edits, and final-block single-carrier edits? This would show how the aggregate TNR relates to the boundary probabilities (as acknowledged by the authors).
(2) Parallel-generation efficiency: What latency, quality, and detection results are obtained when multiple tokens are revealed per denoising step? Please include carrier-rescoring and canonical-repair costs in those measurements. This is necessary to understand efficiency in the parallel-generation setting motivating the paper.
(3) Embedding availability: Across all attempted outputs, what are the success, abort, repair, and retry rates, including outputs with substantial code or mathematics? How are these failures included in reported quality and latency? Appendix C’s unwatermarked-control statistics do not imply successful embedding on such outputs.