A high-load DNN watermarking scheme based on optimal embedding position

Watermarking is crucial for protecting the intellectual property of deep learning models, yet existing watermark embedding schemes fail to meet practical needs. Most white-box watermarking schemes directly select certain model parameters for embedding, lacking flexibility, while black-box watermarking schemes are inefficient and cannot provide sufficient watermark capacity for certain scenarios. Inspired by model compression theory, this paper proposes an efficient DNN watermark embedding scheme based on important weights. First, a small set of inputs is used to identify feature maps with high information content, and the weights corresponding to these feature maps often play a key role in the overall model performance. Then, the watermark is embedded into the model through regularization parameters, allowing real-time embedding during training. Experiments on multiple pre-trained models and related datasets show that this watermarking scheme can effectively resist various attacks, including model pruning and fine-tuning, with a watermark extraction rate of 100%, while maintaining the original model’s classification accuracy at the pre-watermark level. The results also demonstrate that if the original accuracy loss is limited to less than 0.5%, the watermark payload capacity can be significantly increased, providing an effective solution for scenarios requiring the embedding of a large amount of copyright information.

Authors

Institutions

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/icbase63199.2024.10762045
Primary Topic
Advanced Steganography and Watermarking Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A high-load DNN watermarking scheme based on optimal embedding position

Mingyang Zheng, Junling Ren
Advanced Steganography and Watermarking Techniques
article

A high-load DNN watermarking scheme based on optimal embedding position

Mingyang Zheng, Junling Ren
article en

Abstract

Watermarking is crucial for protecting the intellectual property of deep learning models, yet existing watermark embedding schemes fail to meet practical needs. Most white-box watermarking schemes directly select certain model parameters for embedding, lacking flexibility, while black-box watermarking schemes are inefficient and cannot provide sufficient watermark capacity for certain scenarios. Inspired by model compression theory, this paper proposes an efficient DNN watermark embedding scheme based on important weights. First, a small set of inputs is used to identify feature maps with high information content, and the weights corresponding to these feature maps often play a key role in the overall model performance. Then, the watermark is embedded into the model through regularization parameters, allowing real-time embedding during training. Experiments on multiple pre-trained models and related datasets show that this watermarking scheme can effectively resist various attacks, including model pruning and fine-tuning, with a watermark extraction rate of 100%, while maintaining the original model’s classification accuracy at the pre-watermark level. The results also demonstrate that if the original accuracy loss is limited to less than 0.5%, the watermark payload capacity can be significantly increased, providing an effective solution for scenarios requiring the embedding of a large amount of copyright information.

Beijing Information Science & Technology University (CN)
Openalex Percentile: Top 79%
Advanced Steganography and Watermarking Techniques
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.