Watermarking Graph Neural Networks by Random Graphs

被引:11
作者
Zhao, Xiangyu [1 ]
Wu, Hanzhou [1 ]
Zhang, Xinpeng [1 ]
机构
[1] Shanghai Univ, Sch Commun & Inf Engn, Shanghai 200444, Peoples R China
来源
9TH INTERNATIONAL SYMPOSIUM ON DIGITAL FORENSICS AND SECURITY (ISDFS'21) | 2021年
基金
中国国家自然科学基金;
关键词
Watermarking; deep learning; graph neural networks; random graph;
D O I
10.1109/ISDFS52919.2021.9486352
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many learning tasks require us to deal with graph data which contains rich relational information among elements, leading increasing graph neural network (GNN) models to be deployed in industrial products for improving service quality. However, they also raise challenges to model authentication. It is necessary to protect the ownership of the GNN models, which motivates us to watermark GNN models. In this work, an Erdos-Renyi (ER) random graph with random node feature vectors and labels is randomly generated as a trigger to train the GNN to be protected together with the normal samples. During model training, the secret watermark is embedded into the label predictions of graph nodes. During model verification, by activating a marked GNN with the trigger ER graph, the watermark can be reconstructed from the output to verify the ownership. Since the ER graph was randomly generated, by feeding it to a non-marked GNN, the label predictions of graph nodes are random, resulting in a low false alarm rate (of proposed work). Experimental results have also shown that, the performance of a marked GNN on its original task will not be impaired. And, it is robust against model compression and fine-tuning, which has shown superiority and applicability.
引用
收藏
页数:6
相关论文
共 18 条
[1]  
[Anonymous], 2018, ARXIV180204633
[2]  
Chapelle O., 2006, IEEE T NEURAL NETW 2
[3]  
Erdos P., 2022, I Publicationes Mathematicae Debrecen, V6, P290
[4]  
Gammerman A, 2013, Arxiv, DOI arXiv:1301.7375
[5]  
Glorot X., 2011, P 14 INT C ART INT S, P315
[6]  
Kingma DP, 2014, ADV NEUR IN, V27
[7]  
Hamilton WL, 2018, Arxiv, DOI [arXiv:1706.02216, DOI 10.48550/ARXIV.1706.02216]
[8]  
Kipf TN, 2017, Arxiv, DOI [arXiv:1609.02907, DOI 10.48550/ARXIV.1609.02907]
[9]  
Namata G., 2012, P INT WORKSH MIN LEA
[10]   Collective Classification in Network Data [J].
Sen, Prithviraj ;
Namata, Galileo ;
Bilgic, Mustafa ;
Getoor, Lise ;
Gallagher, Brian ;
Eliassi-Rad, Tina .
AI MAGAZINE, 2008, 29 (03) :93-106