arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.00455cs.SIcs.CRcs.LG

Secure Deep Graph Generation with Link Differential Privacy

Emory University(埃默里大学);University of Illinois at Urbana Champaign(伊利诺伊大学厄巴纳-香槟分校);University of Hong Kong(香港大学);Sun Yat-sen University(中山大学);Lehigh University(理海大学)

Carl Yang, Haonan Wang, Ke Zhang, Liang Chen, Lichao Sun

英文摘要:

Many data mining and analytical tasks rely on the abstraction of networks (graphs) to summarize relational structures among individuals (nodes). Since relational data are often sensitive, we aim to seek effective approaches to generate utility-preserved yet privacy-protected structured data. In this paper, we leverage the differential privacy (DP) framework to formulate and enforce rigorous privacy constraints on deep graph generation models, with a focus on edge-DP to guarantee individual link privacy. In particular, we enforce edge-DP by injecting proper noise to the gradients of a link reconstruction-based graph generation model, while ensuring data utility by improving structure learning with structure-oriented graph discrimination. Extensive experiments on two real-world network datasets show that our proposed DPGGAN model is able to generate graphs with effectively preserved global structure and rigorously protected individual link privacy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑