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

📅 2026-09-02
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
为解决多比特LLM水印技术在提取精度、文本质量和载荷容量间的权衡问题,提出WeaveMark方案,通过编码载荷扩散等方法提高性能。
📝 Abstract
Multi-bit watermarking for large language models (LLMs) enables content source tracing by embedding user-identifiable messages into generated text. Existing methods face a fundamental trade-off among extraction accuracy, text quality, and payload capacity. We propose WeaveMark, a robust and scalable multi-bit LLM watermarking scheme based on coded payload spreading. WeaveMark shifts this trade-off frontier by improving payload capacity through multi-bit-per-token spreading, improving extraction accuracy through soft-decision error-correcting code, and preserving text quality through unbiased multilayer reweighting. It further introduces dedicated zero-bit layers for reliable watermark presence detection. Experiments show large gains, especially for long messages and edited text. WeaveMark achieves 89.8% match rate for 32-bit messages at 200 tokens, compared with 20.8% for BiMark. Under 10% substitution attacks on 16-bit messages at 200 tokens, it maintains 86.0% versus 30.7%, while preserving text quality. Our code is available at https://github.com/qkrrkd90-source/WeaveMark.
Problem

Research questions and friction points this paper is trying to address.

multi-bit watermarking
large language models
extraction accuracy
text quality
payload capacity
Innovation

Methods, ideas, or system contributions that make the work stand out.

multi-bit-per-token spreading
soft-decision error-correcting code
unbiased multilayer reweighting
zero-bit layers
G
Gang-Hyun Park
University of Ulsan, Ulsan, Republic of Korea
J
Ju-Hyeong Lee
University of Ulsan, Ulsan, Republic of Korea
H
Hee-Youl Kwak
University of Ulsan, Ulsan, Republic of Korea
D
Dae-Young Yun
University of Ulsan, Ulsan, Republic of Korea