Lune

ICML2026顶会

Collaborative Threshold Watermarking

Tameem Bakr, Anish Ambreth, Nils Lukas

2026年份

摘要

In federated learning (FL), KK clients jointly train a model without sharing raw data. Because each participant invests data and compute, clients need mechanisms to later prove the provenance of a jointly trained model. Model watermarking embeds a hidden signal in the weights, but naive approaches either do not scale with many clients as per-client watermarks dilute as KK grows, or give any individual client the ability to verify and potentially remove the watermark. We introduce (t,K)(t,K)-threshold watermarking: clients collaboratively embed a shared watermark during training, while only coalitions of at least tt clients can reconstruct the watermark key and verify a suspect model. We secret-share the watermark key τ\tau so that coalitions of fewer than tt clients cannot reconstruct it, and verification can be performed without revealing τ\tau in the clear. We instantiate our protocol in the white-box setting and evaluate it on image classification tasks on both IID and non-IID partitions, as well as language models fine-tuning setting. Our watermark remains detectable at scale (K=128K=128) with minimal accuracy loss and stays above the detection threshold (z≥4z\ge 4) under attacks including adaptive fine-tuning using up to 20% of the training data. Code is available at https://github.com/tameemalaa/collaborative-threshold-watermark.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

它引用的顶会 Paper5

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖