arXiv Computation and Language

Semantic Watermarking with Order-Robust Detection over Sub-sentence Units

The paper introduces an adaptive embedding displacement attack (EDA) that exploits rewording, reordering, and resegmentation to remove semantic watermarks from text, achieving a 32.6%–47.9% success rate across four watermarking schemes. To counter this, the authors propose k‑SwordStamp, a semantic watermarking method that uses order‑robust detection over sub‑sentence units, significantly reducing vulnerability to structure‑based edits. Experiments show that EDA remains effective against k‑SwordStamp, but with a lower success rate (10.8%) compared to its performance on other schemes.

arXiv AI
Oct 5

Mitigating Watermark Forgery in Generative Models via Randomized Key Selection

The paper proposes a defense against watermark forgery in generative models by randomizing the selection of watermark keys for each query and accepting content only if exactly one key detects a watermark. This approach provides a sample‑count‑independent upper bound on forgery success for blind attackers while preserving model utility. Experiments show a dramatic drop in forgery success rates—from 87% to 1% with four keys for text and from 100% to 2% for images—without significant computational overhead.

By Toluwani Aremu, Noor Hussein, Munachiso Nwadike, Samuele Poppi, Jie Zhang, Karthik Nandakumar, Neil Gong, Nils Lukas
arXiv Machine Learning
Oct 8

Constitution-Guided Watermarking

arXiv:2610.09552v1 Announce Type: cross Abstract: Watermarking enables language model providers to identify text generated by their models. However, its desired properties can conflict (\ie~stronger...

By Toluwani Aremu, Samuele Poppi, Nils Lukas
arXiv Machine Learning
Sep 30

Dataset Watermarking with Provable Black-Box Detection

The paper introduces a dataset watermarking technique that embeds a watermark by increasing the co‑occurrence of randomly selected word pairs through meaning‑preserving local edits. The watermark can be detected solely from generated text with provable false‑positive control, and experiments on four base models and three datasets show reliable detection (p < 0.01) even when the watermarked data constitutes less than 5% of fine‑tuning tokens. Compared to existing methods, the approach better preserves benchmark utility and semantic integrity.

By Pengrun Huang, Kamalika Chaudhuri, Yu-Xiang Wang