ZK-AdapterMark: Privacy-Preserving Provenance Evidence for LoRA Adapters

Low-rank adaptation (LoRA) fine-tunes a large model with a low-rank update over frozen weights. The update travels as a separate adapter file that is easy to copy, alter, and re-upload; so, a hub may have to decide whether a disputed file derives from a registered adapter. Since an altered copy no longer matches the original byte for byte, the usual tool is a fingerprint, secret measurements of the weights that survive moderate edits. Verifying a fingerprint currently requires disclosing either the measurements, which a copier can then evade, or the possibly confidential weights. ZK-AdapterMark is, to our knowledge, the first to verify a LoRA fingerprint in zero knowledge: a hub confirms that a disputed file passes a registered fingerprint without learning the secret or the weights. The proof is practical because our fingerprint is expressed over the two low-rank factors, making the complete proof circuit up to 44 times smaller than rebuilding the update. The acceptance threshold fixes a relative-entropy bound on the probability of accepting an unrelated adapter, which gives it an information-theoretic footing. Across ten model families, the fingerprint survives moderate quantization, noise, and rank reduction, and no pair among 904 independently trained adapters is accepted.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-10-14
DOI
https://doi.org/10.3390/e28101128
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ZK-AdapterMark: Privacy-Preserving Provenance Evidence for LoRA Adapters

Wangyu Wu, Renwen Ma, Yicheng Yu
Entropy
Cryptography and Data Security
article

ZK-AdapterMark: Privacy-Preserving Provenance Evidence for LoRA Adapters

Wangyu Wu, Renwen Ma, Yicheng Yu
article en

Abstract

Low-rank adaptation (LoRA) fine-tunes a large model with a low-rank update over frozen weights. The update travels as a separate adapter file that is easy to copy, alter, and re-upload; so, a hub may have to decide whether a disputed file derives from a registered adapter. Since an altered copy no longer matches the original byte for byte, the usual tool is a fingerprint, secret measurements of the weights that survive moderate edits. Verifying a fingerprint currently requires disclosing either the measurements, which a copier can then evade, or the possibly confidential weights. ZK-AdapterMark is, to our knowledge, the first to verify a LoRA fingerprint in zero knowledge: a hub confirms that a disputed file passes a registered fingerprint without learning the secret or the weights. The proof is practical because our fingerprint is expressed over the two low-rank factors, making the complete proof circuit up to 44 times smaller than rebuilding the update. The acceptance threshold fixes a relative-entropy bound on the probability of accepting an unrelated adapter, which gives it an information-theoretic footing. Across ten model families, the fingerprint survives moderate quantization, noise, and rank reduction, and no pair among 904 independently trained adapters is accepted.

EntropyVol. 28(10)
University of Liverpool (GB), Shenzhen Polytechnic University (CN)
Openalex Percentile: Top 13%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.