SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models

Amirhossein Dabiriaghdam, Lele Wang
2/5/2025
cs.CLcs.CRcs.CY

No official code found. Best implementation: DabiriAghdam/SimMark (14 stars, MIT, last commit 2025-08-26).

Abstract

The widespread adoption of large language models (LLMs) necessitates reliable methods to detect LLM-generated text. We introduce SimMark, a robust sentence-level watermarking algorithm that makes LLMs' outputs traceable without requiring access to model internals, making it compatible with both open and API-based LLMs. By leveraging the similarity of semantic sentence embeddings combined with rejection sampling to embed detectable statistical patterns imperceptible to humans, and employing a soft counting mechanism, SimMark achieves robustness against paraphrasing attacks. Experimental results demonstrate that SimMark sets a new benchmark for robust watermarking of LLM-generated content, surpassing prior sentence-level watermarking techniques in robustness, sampling efficiency, and applicability across diverse domains, all while maintaining the text quality and fluency.

View on arXivView PDF

Code Implementations(1)

MIT

This is the official repository of the paper SimMark. SimMark is a sentence-level watermarking algorithm that achieves state-of-the-art detection performance and robustness against paraphrasing, without requiring access to model internals.

140PythonFeb 3, 20251 years agoMIT

Similar Papers

Cite this paper

@article{dabiriaghdam2025simmark,
  title  = {SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models},
  author = {Amirhossein Dabiriaghdam and Lele Wang},
  year   = {2025},
  eprint = {2502.02787},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.02787v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.02787.svg)](https://codeofpaper.com/paper/2502.02787)

Discussion