Skip to content

TANGO: Watermarking Masked Diffusion Language Models in Token Pairs

Sep 2026 · 0 citations · 45 references
Computer Science

TL;DR

TANGO is presented, a watermark for masked-diffusion language models that keys each new token to a nearby token that is already unmasked, and TANGO biases the new token toward a color determined by the key and the nearby token's color.

Abstract

Masked-diffusion language models fill in masked positions in parallel and in no fixed order. Most practical text watermarks assume left-to-right generation. They key each token to the tokens before it, and in a diffusion model those tokens may still be masked. A fixed green list needs no such context, but it favors the same tokens at every position, so these tokens appear more often in watermarked text. An attacker who compares token frequencies in watermarked and unwatermarked text can recover the list and forge text that the provider's own detector accepts. We present TANGO, a watermark for masked-diffusion language models that keys each new token to a nearby token that is already unmasked. A secret key splits the vocabulary into color classes, and TANGO biases the new token toward a color determined by the key and the nearby token's color. The watermark is therefore embedded in pairs of tokens. Because the favored color changes from position to position, token frequencies stay much closer to those of unwatermarked text than under a fixed green list. Detection needs only the text and the key, and it does not assume any unmasking order. On two masked-diffusion models, TANGO detects nearly all unedited watermarked texts and most edited ones, and frequency attacks that forge the fixed green list fail against it.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

OpenStamp: A Watermark for Open-Source Language Models

This work introduces OpenStamp, a watermarking technique that encodes the watermarking logic directly into the model weights by modifying only the final projection, or unembedding, layer, and shows that OpenStamp achieves superior detection performance, with minimal degradation in model capabilities compared to prior m...

Miroojin Bakshi, Saksham Rastogi, Danish Pruthi · 0 citations
#machine learning Preprint Sep 2026

Flip, Don't Shuffle: Watermarking LLMs at the Speed of Inference

Stateless Bernoulli Watermarking (SBW) is introduced, a new statistical watermark for Large Language Models that determines green list membership through independent per-token Bernoulli trials, reducing membership complexity to $O(1)$ and enabling single-kernel execution with zero intermediate allocations.

Simone Ceppi, Ignacio Sanchez · 0 citations
#natural language process... Preprint Sep 2026

TTMark: Pairwise Distortion-Free Watermarking Beyond Single-Token Entropy

Tandem Token WaterMark (TTMARK), a general pairwise watermarking framework that extends distortion-free watermarking from individual tokens to adjacent token pairs, and introduces a branch-isolating concatenated tandem generation algorithm that efficiently constructs the joint distribution in a single forward pass.

Rui-Bo Chen, Zheng-Mian Hu, Dong-Hang Lu et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Grammar-Guided Code Watermarking with Green Temperature

Large language model watermarking embeds detectable statistical signals during decoding, but the resulting changes to token probabilities can degrade generation quality. This trade-off is particularly important for code, where small changes in token selection can break syntax or alter program behavior. Existing code wa...

Hyundong Jin, Hyeseon An, Soohan Lim et al. · 0 citations
#natural language process... Preprint Sep 2026

CertMark: Distortion-Free Multi-Bit Watermarking with Certified Decoding

Leading multi-bit watermarking methods for language models encode messages by biasing the model's next-token probabilities, creating a trade-off between message recovery and text quality. Their decoders typically return the highest-scoring candidate from accumulated token-level evidence, without a certified abstention...

Pawel Batorski, P. Spurek, Paul Swoboda · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.