{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T18:54:55Z","timestamp":1791485695171,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645531","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"1170-1181","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["DPAR: Decoupled Graph Neural Networks with Node-Level Differential Privacy"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7054-1983","authenticated-orcid":false,"given":"Qiuchen","family":"Zhang","sequence":"first","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4909-9027","authenticated-orcid":false,"given":"Hong kyu","family":"Lee","sequence":"additional","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0019-9251","authenticated-orcid":false,"given":"Jing","family":"Ma","sequence":"additional","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4110-2068","authenticated-orcid":false,"given":"Jian","family":"Lou","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9145-4531","authenticated-orcid":false,"given":"Carl","family":"Yang","sequence":"additional","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7354-0428","authenticated-orcid":false,"given":"Li","family":"Xiong","sequence":"additional","affiliation":[{"name":"Emory University, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Martin Abadi Andy Chu Ian Goodfellow H Brendan McMahan Ilya Mironov Kunal Talwar and Li Zhang. 2016. Deep learning with differential privacy. In ACM SIGSAC CCS.","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2901716"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Raef Bassily Adam Smith and Abhradeep Thakurta. 2014. Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds. arxiv: 1405.7085 [cs.LG]","DOI":"10.1109\/FOCS.2014.56"},{"key":"e_1_3_2_2_5_1","volume-title":"Shiva Prasad Kasiviswanathan, and Kobbi Nissim","author":"Beimel Amos","year":"2014","unstructured":"Amos Beimel, Hai Brenner, Shiva Prasad Kasiviswanathan, and Kobbi Nissim. 2014. Bounds on the sample complexity for private learning and private data release. Machine learning , Vol. 94 (2014), 401--437."},{"key":"e_1_3_2_2_6_1","volume-title":"Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. ICLR","author":"Bojchevski Aleksandar","year":"2018","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. ICLR (2018)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0344-8"},{"key":"e_1_3_2_2_9_1","volume-title":"Gaurav Aggarwal, and Prateek Jain.","author":"Daigavane Ameya","year":"2021","unstructured":"Ameya Daigavane, Gagan Madan, Aditya Sinha, Abhradeep Guha Thakurta, Gaurav Aggarwal, and Prateek Jain. 2021. Node-level differentially private graph neural networks. arXiv preprint arXiv:2111.15521 (2021)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2926745"},{"key":"e_1_3_2_2_11_1","volume-title":"On the Equivalence of Decoupled Graph Convolution Network and Label Propagation. The World Wide Web Conference","author":"Dong Hande","year":"2021","unstructured":"Hande Dong, Jiawei Chen, Fuli Feng, Xiangnan He, Shuxian Bi, Zhaolin Ding, and Peng Cui. 2021. On the Equivalence of Decoupled Graph Convolution Network and Label Propagation. The World Wide Web Conference (2021)."},{"key":"e_1_3_2_2_12_1","first-page":"3532","article-title":"Practical Differentially Private Top-k Selection with Pay-what-you-get Composition","volume":"32","author":"Durfee David","year":"2019","unstructured":"David Durfee and Ryan M Rogers. 2019. Practical Differentially Private Top-k Selection with Pay-what-you-get Composition. Advances in Neural Information Processing Systems , Vol. 32 (2019), 3532--3542.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_13_1","volume-title":"Foundations and Trends\u00ae in Theoretical Computer Science","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork, Aaron Roth, et al. 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, Vol. 9, 3--4 (2014), 211--407."},{"key":"e_1_3_2_2_14_1","volume-title":"Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank. arXiv preprint arXiv:2207.06944","author":"Epasto Alessandro","year":"2022","unstructured":"Alessandro Epasto, Vahab Mirrokni, Bryan Perozzi, Anton Tsitsulin, and Peilin Zhong. 2022. Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank. arXiv preprint arXiv:2207.06944 (2022)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1214-8"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813677"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2019.8651689"},{"key":"e_1_3_2_2_18_1","volume-title":"PageRank beyond the Web. siam REVIEW","author":"Gleich David F","year":"2015","unstructured":"David F Gleich. 2015. PageRank beyond the Web. siam REVIEW, Vol. 57, 3 (2015), 321--363."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294869"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588705"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915215"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2685505"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_26"},{"key":"e_1_3_2_2_25_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. ICLR","author":"Klicpera Johannes","year":"2019","unstructured":"Johannes Klicpera, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2019. Predict then propagate: Graph neural networks meet personalized pagerank. ICLR (2019)."},{"key":"e_1_3_2_2_26_1","unstructured":"Jaewoo Lee and Daniel Kifer. 2018. Concentrated differentially private gradient descent with adaptive per-iteration privacy budget. In KDD."},{"key":"e_1_3_2_2_27_1","volume-title":"Adversarial Privacy Preserving Graph Embedding against Inference Attack","author":"Li Kaiyang","year":"2020","unstructured":"Kaiyang Li, Guangchun Luo, Yang Ye, Wei Li, Shihao Ji, and Zhipeng Cai. 2020. Adversarial Privacy Preserving Graph Embedding against Inference Attack. IEEE Internet of Things Journal (2020)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583150"},{"key":"e_1_3_2_2_29_1","volume-title":"Towards Private Learning on Decentralized Graphs with Local Differential Privacy. arXiv:2201.09398","author":"Lin Wanyu","year":"2022","unstructured":"Wanyu Lin, Baochun Li, and Cong Wang. 2022. Towards Private Learning on Decentralized Graphs with Local Differential Privacy. arXiv:2201.09398 (2022)."},{"key":"e_1_3_2_2_30_1","volume-title":"26th ACM SIGKDD. 338--348.","author":"Liu Meng","unstructured":"Meng Liu, Hongyang Gao, and Shuiwang Ji. 2020. Towards deeper graph neural networks. In 26th ACM SIGKDD. 338--348."},{"key":"e_1_3_2_2_31_1","first-page":"29929","article-title":"DP-PCA: Statistically Optimal and Differentially Private PCA","volume":"35","author":"Liu Xiyang","year":"2022","unstructured":"Xiyang Liu, Weihao Kong, Prateek Jain, and Sewoong Oh. 2022. DP-PCA: Statistically Optimal and Differentially Private PCA. Advances in Neural Information Processing Systems , Vol. 35 (2022), 29929--29943.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623683"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467350"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357878"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2022.101695"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808797.2809385"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484565"},{"key":"e_1_3_2_2_38_1","volume-title":"GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation. In 32nd USENIX Security Symposium.","author":"Sajadmanesh Sina","year":"2023","unstructured":"Sina Sajadmanesh, Ali Shahin Shamsabadi, Aur\u00e9lien Bellet, and Daniel Gatica-Perez. 2023. GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation. In 32nd USENIX Security Symposium."},{"key":"e_1_3_2_2_39_1","volume-title":"Relational Representation Learning Workshop (R2L 2018","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. Relational Representation Learning Workshop (R2L 2018), NeurIPS (2018)."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00182"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623642"},{"key":"e_1_3_2_2_43_1","volume-title":"Secure Network Release with Link Privacy. arXiv:2005.00455","author":"Yang Carl","year":"2020","unstructured":"Carl Yang, Haonan Wang, Lichao Sun, and Bo Li. 2020. Secure Network Release with Link Privacy. arXiv:2005.00455 (2020)."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737785"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350253"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/464"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378274"},{"key":"e_1_3_2_2_48_1","volume-title":"Graph Embedding for Recommendation against Attribute Inference Attacks. arXiv:2101.12549","author":"Zhang Shijie","year":"2021","unstructured":"Shijie Zhang, Hongzhi Yin, Tong Chen, Zi Huang, Lizhen Cui, and Xiangliang Zhang. 2021c. Graph Embedding for Recommendation against Attribute Inference Attacks. arXiv:2101.12549 (2021)."},{"key":"e_1_3_2_2_49_1","volume-title":"31st USENIX Security Symposium (USENIX Security 22)","author":"Zhang Zhikun","year":"2022","unstructured":"Zhikun Zhang, Min Chen, Michael Backes, Yun Shen, and Yang Zhang. 2022. Inference attacks against graph neural networks. In 31st USENIX Security Symposium (USENIX Security 22). 4543--4560."},{"key":"e_1_3_2_2_50_1","volume-title":"Graphmi: Extracting private graph data from graph neural networks. arXiv preprint arXiv:2106.02820","author":"Zhang Zaixi","year":"2021","unstructured":"Zaixi Zhang, Qi Liu, Zhenya Huang, Hao Wang, Chengqiang Lu, Chuanren Liu, and Enhong Chen. 2021a. Graphmi: Extracting private graph data from graph neural networks. arXiv preprint arXiv:2106.02820 (2021)."}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645531","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:24:48Z","timestamp":1755822288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":50,"alternative-id":["10.1145\/3589334.3645531","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645531","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}