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.
Abstract
Distortion-free watermarking enables reliable attribution of machine-generated text while preserving output distribution. However, existing methods operate independently on each generated token, making their detection capability fundamentally constrained by the entropy of the next-token distribution. We present Tandem Token WaterMark (TTMARK), a general pairwise watermarking framework that extends distortion-free watermarking from individual tokens to adjacent token pairs. By watermarking the joint distribution of consecutive tokens, TTMARK enlarges the effective watermarking alphabet from V to $V^2$, allowing the detector to exploit both token entropy and conditional entropy while preserving distortion-freeness over the joint distribution. We further introduce a branch-isolating concatenated tandem generation algorithm that efficiently constructs the joint distribution in a single forward pass. Theoretically, we show that pairwise watermarking achieves better expected detection strength in low-entropy regimes. Extensive experiments across multiple language models, datasets, and three representative distortion-free watermarking schemes demonstrate that TTMARK consistently improves detectability without degrading generation quality, while also improving robustness to edits and substantially enhancing localized watermark detection.
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
We introduce a framework for multi-bit text watermarking with security defined directly through $f$-divergence from the base language model distribution. Unlike prior approaches that focus on average-key distortion-freeness or a particular statistical distance, our formulation supports general $f$-divergences, includin...
Benjamin D. Kim, Wan-Rong Zhang, Wei-Tong Ruan et al.· 0 citations
Redwing is proposed, a design principle for robust token-level watermarking that generalizes to TTS models at a speech-quality cost close to that of KGW and shows that retokenization is not merely a source of noise: its transition structure can be exploited as a design principle for robust token-level watermarking.
WeaveMark, a robust and scalable multi-bit LLM watermarking scheme based on coded payload spreading, improves payload capacity through multi-bit-per-token spreading (weaving), improving extraction accuracy through soft-decision error-correcting codes, and preserving text quality through unbiased multilayer reweighting.
Gang-Hyun Park, Ju-Hyeong Lee, Heeyoul Kwak et al.· 0 citations
Experiments across four controlled manipulation types under ideal channel conditions show that the embedded payload, and hence an approximate reconstruction of the authentic content, is always fully recovered without bit errors, and the results indicate that the choice of neural codec is the dominant factor for detecti...
Yigitcan Özer, Xin Wang, Zhe Zhang et al.· 0 citations
(k)-SwordStamp is designed: semantic watermarks with order-robust detection over sub-sentence units, reducing sensitivity to attacker-chosen structure at a small quality cost.
Abdulrahman Diaa, Jonathan Petit, Florian Kerschbaum· 2 citations