arXiv Computation and Language

Anchor-ECC: Local Integrity Checking for Watermarked LLM Outputs via Error-Correcting Codes

arXiv Computation and Language
2d ago

CORE-BREW: LLR-Based Soft Decoding for Robust Multi-Bit LLM Watermarking

CORE-BREW is a new multi‑bit watermarking method for large language models that uses log‑likelihood ratios for soft‑decision decoding, targeting a fixed hit rate to calibrate the watermark channel. It introduces entropy‑aware erasures to reduce perturbations in low‑entropy contexts and combines likelihood‑based scoring with soft‑decision list decoding to better exploit token‑level reliability. Experiments on open‑source LLMs show that CORE‑BREW improves detection robustness and payload recovery compared to the BREW baseline while keeping false‑positive rates low and maintaining translation quality metrics close to unwatermarked text.

By Joeun Kim, HoEun Kim, Young-Sik Kim
arXiv Machine Learning
2d ago

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
arXiv Machine Learning
Sep 3

WeaveMark: Robust and Scalable Multi-bit LLM Watermarking via Coded Payload Spreading

WeaveMark is a new multi‑bit watermarking scheme for large language models that improves payload capacity, extraction accuracy, and text quality by using coded payload spreading, soft‑decision error‑correcting codes, and unbiased multilayer reweighting. It also adds zero‑bit layers for reliable detection of watermark presence. Experiments demonstrate significant gains, achieving an 89.8% match rate for 32‑bit messages at 200 tokens and maintaining 86.0% accuracy under 10% substitution attacks on 16‑bit messages, far outperforming the BiMark baseline.

By Gang-Hyun Park, Ju-Hyeong Lee, Hee-Youl Kwak, Dae-Young Yun
arXiv Computer Vision
Sep 7

AngelFingerprint: A Traceable, Explainable, and White-Box Stealthy Watermark for Text-Guided Image Editing

AngelFingerprint introduces a watermarking framework for text-guided image editing that embeds the editing prompt’s CLIP text embedding directly into the diffusion model’s weights via a LoRA module. The watermark is recoverable from image pixels alone, providing an explainable trace of the edit while remaining stealthy even under full white-box access. Experiments on the MagicBrush dataset show the extractor achieves 86% top‑1 accuracy in 200‑way prompt retrieval, outperforming prompt inversion methods.

By Bo-Han Kung, Futa Waseda, Ching-Chun Chang, Isao Echizen, Shang-Tse Chen
arXiv Computation and Language
Aug 31

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.

By Abdulrahman Diaa, Jonathan Petit, Florian Kerschbaum
arXiv AI
Sep 11

Watermarks Without Verification: AI Text Watermarking After the EU AI Act

The paper discusses the EU AI Act’s requirement for generative AI providers to embed detectable watermarks in their outputs, noting that Anthropic’s Claude models and Google’s Gemini use SynthID‑Text by default. It critiques the lack of verifiability of claims about watermark quality, privacy, and robustness, and evaluates the open‑source SynthID‑Text implementation on two open‑weight models, finding minimal impact on prose and modest correctness loss on code. The authors argue that the real governance issue is the inability to verify these assertions and outline necessary steps—such as output release, configuration disclosure, accredited audits, shared evaluation protocols, and interoperable detection—to address the gaps.

By Alexander Nemecek, Vipin Chaudhary, Erman Ayday