PVMark: Enabling Public Verifiability for LLM Watermarking Schemes
Haohua Duan, Liyao Xiang, Xin Zhang

TL;DR
PVMark introduces a zero-knowledge proof-based method that allows third parties to publicly verify LLM watermarks without revealing secret keys, enhancing trustworthiness and practical deployability.
Contribution
It proposes PVMark, a novel ZKP-based framework for public verifiability of LLM watermarks, addressing trust issues in existing schemes.
Findings
Effective public verifiability demonstrated across multiple implementations.
Maintains watermarking performance without revealing secret keys.
Compatible with various watermarking schemes and ZKP protocols.
Abstract
Watermarking schemes for large language models (LLMs) have been proposed to identify the source of the generated text, mitigating the potential threats emerged from model theft. However, current watermarking solutions hardly resolve the trust issue: the non-public watermark detection cannot prove itself faithfully conducting the detection. We observe that it is attributed to the secret key mostly used in the watermark detection -- it cannot be public, or the adversary may launch removal attacks provided the key; nor can it be private, or the watermarking detection is opaque to the public. To resolve the dilemma, we propose PVMark, a plugin based on zero-knowledge proof (ZKP), enabling the watermark detection process to be publicly verifiable by third parties without disclosing any secret key. PVMark hinges upon the proof of `correct execution' of watermark detection on which a set of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
