{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:30:15Z","timestamp":1766068215830,"version":"3.43.0"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFC3304700"],"award-info":[{"award-number":["2023YFC3304700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72071125","72031001"],"award-info":[{"award-number":["72071125","72031001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2023YFC3304700"],"award-info":[{"award-number":["2023YFC3304700"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72031001","72242101"],"award-info":[{"award-number":["72031001","72242101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Outstanding Young Scientist Program of Beijing Universities","award":["JWZQ20240201002"],"award-info":[{"award-number":["JWZQ20240201002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3592828","type":"journal-article","created":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T17:55:44Z","timestamp":1753466144000},"page":"8327-8340","source":"Crossref","is-referenced-by-count":1,"title":["Learning-Based Privacy-Preserving Graph Publishing Against Sensitive Link Inference Attacks"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4689-9555","authenticated-orcid":false,"given":"Yucheng","family":"Wu","sequence":"first","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies, Ministry of Education, and the School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8968-0162","authenticated-orcid":false,"given":"Yuncong","family":"Yang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Interdisciplinary Research of Computation and Economics, Ministry of Education, and the School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1331-0860","authenticated-orcid":false,"given":"Xiao","family":"Han","sequence":"additional","affiliation":[{"name":"Key Laboratory of Data Intelligence and Management, Ministry of Industry and Information Technology, and the School of Economics and Management, Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7627-8485","authenticated-orcid":false,"given":"Leye","family":"Wang","sequence":"additional","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies, Ministry of Education, and the School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7650-3657","authenticated-orcid":false,"given":"Junjie","family":"Wu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Data Intelligence and Management, Ministry of Industry and Information Technology, and the School of Economics and Management, Beihang University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2014.11.008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.123.2100773"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3130762"},{"volume-title":"SNAP Datasets: Stanford Large Network Dataset Collection","year":"2014","author":"Leskovec","key":"ref5"},{"volume-title":"AMiner Dataset","year":"2023","key":"ref6"},{"volume-title":"Facebook Graph API","year":"2023","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052695"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.23032"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3448891.3448939"},{"volume-title":"General Data Protection Regulation (GDPR)","year":"2023","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2019.2919833"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3264110"},{"key":"ref14","first-page":"2669","article-title":"Stealing links from graph neural networks","volume-title":"Proc. USENIX Secur. Symp.","author":"He"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2933833"},{"key":"ref16","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref17","article-title":"A survey on graph structure learning: Progress and opportunities","author":"Zhu","year":"2021","journal-title":"arXiv:2103.03036"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512206"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3389\/fcomp.2021.563060"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.16"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"article-title":"How powerful are graph neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref25","first-page":"22667","article-title":"SLAPS: Self-supervision improves structure learning for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Fatemi"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512186"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2971648.2971685"},{"key":"ref28","first-page":"513","article-title":"AttriGuard: A practical defense against attribute inference attacks via adversarial machine learning","volume-title":"Proc. 27th USENIX Security Symp. (USENIX Secur.)","author":"Jia"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3087515"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243855"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483382"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3331568"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134277"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411866"},{"key":"ref35","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref36","first-page":"5171","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref37","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016","journal-title":"arXiv:1611.07308"},{"article-title":"InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Sun","key":"ref38"},{"key":"ref39","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"You"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833806"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/EAIS58494.2024.10569101"},{"key":"ref43","first-page":"3241","article-title":"PrivGraph: Differentially private graph data publication by exploiting community information","volume-title":"Proc. USENIX Secur.","author":"Yuan"},{"article-title":"Preserving link privacy in social network based systems","volume-title":"Proc. 20th Annu. Netw. Distrib. Syst. Secur. Symp.","author":"Mittal","key":"ref44"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78478-4_9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0353-5"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.67"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247610"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0240-6"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978319"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2808797.2809385"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0344-8"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623642"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134086"},{"key":"ref55","first-page":"1895","article-title":"Evaluating differentially private machine learning in practice","volume-title":"Proc. 28th USENIX Secur. Symp. (USENIX Secur.)","author":"Jayaraman"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3627106.3627115"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106674"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623173"},{"key":"ref59","first-page":"41737","article-title":"Demystifying uneven vulnerability of link stealing attacks against graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"202","author":"Zhang"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00139"},{"key":"ref61","first-page":"3223","article-title":"GAP: Differentially private graph neural networks with aggregation perturbation","volume-title":"Proc. 32nd USENIX Secur. Symp. (USENIX Secur.)","author":"Sajadmanesh"},{"key":"ref62","first-page":"19314","article-title":"Iterative deep graph learning for graph neural networks: Better and robust node embeddings","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Chen"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441734"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20335"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599476"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539484"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570455"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3542597"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2024.3369017"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/11096916.pdf?arnumber=11096916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T17:33:37Z","timestamp":1755106417000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11096916\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":69,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3592828","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2025]]}}}