{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:07:06Z","timestamp":1755220026377,"version":"3.43.0"},"reference-count":50,"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":[{"name":"National Young Top-notch Talent Research Program","award":["SR\/FST\/ET-I\/2017\/68"],"award-info":[{"award-number":["SR\/FST\/ET-I\/2017\/68"]}]},{"name":"Science and Technology Program of Guangzhou","award":["2024A03J0464"],"award-info":[{"award-number":["2024A03J0464"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3594145","type":"journal-article","created":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T18:50:15Z","timestamp":1753901415000},"page":"8178-8193","source":"Crossref","is-referenced-by-count":0,"title":["LapGLP: Approximating Infinite-Layer Graph Convolutions With Laplacian for Federated Recommendation"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1571-4267","authenticated-orcid":false,"given":"Zhi","family":"Li","sequence":"first","affiliation":[{"name":"Cyber Security, Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1958-4644","authenticated-orcid":false,"given":"Chaozhuo","family":"Li","sequence":"additional","affiliation":[{"name":"Key Laboratory of Trustworthy Distributed Computing and Service (MoE), Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4294-0212","authenticated-orcid":false,"given":"Feiran","family":"Huang","sequence":"additional","affiliation":[{"name":"Cyber Security, Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2111-7385","authenticated-orcid":false,"given":"Xi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Trustworthy Distributed Computing and Service (MoE), Beijing University of Posts and Telecommunications, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4067-8230","authenticated-orcid":false,"given":"Jian","family":"Weng","sequence":"additional","affiliation":[{"name":"National Joint Engineering Research Center of Network Security Detection and Protection Technology, Jinan University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3491-5968","authenticated-orcid":false,"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3527449"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3556536"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3145690"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3572834"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2856910"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.128"},{"key":"ref7","article-title":"FedGNN: Federated graph neural network for privacy-preserving recommendation","author":"Wu","year":"2021","journal-title":"arXiv:2102.04925"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474262"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2022.04.034"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2020.3014880"},{"key":"ref11","first-page":"4224","article-title":"Fedrec++: Lossless federated recommendation with explicit feedback","volume-title":"Proc. 35th AAAI Conf. Artif. Intell., 33rd Conf. Innov. Appl. Artif. Intell., 11th Symp. Educ. Adv. Artif. Intell.","author":"Liang"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3501815"},{"key":"ref14","article-title":"FedML-HE: An efficient homomorphic-encryption-based privacy-preserving federated learning system","author":"Jin","year":"2023","journal-title":"arXiv:2303.10837"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.103996"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i10.28950"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-30714-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645693"},{"key":"ref19","first-page":"2667","article-title":"Predict then propagate: Graph neural networks meet personalized PageRank","volume-title":"Proc. 7th Int. Conf. Learn. Represent.","author":"Gasteiger"},{"key":"ref20","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref21","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref22","article-title":"Graph convolutional matrix completion","author":"van den Berg","year":"2017","journal-title":"arXiv:1706.02263"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401137"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462868"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2020.3017205"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512192"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108441"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/507"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25566"},{"key":"ref32","first-page":"26956","article-title":"Federated recommendation with additive personalization","volume-title":"Proc. 12th Int. Conf. Learn. Represent.","author":"Li"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645626"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557668"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"ref36","first-page":"2713","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Represent.","author":"Kipf"},{"key":"ref37","first-page":"3538","article-title":"Deeper insights into graph convolutional networks for semi-supervised learning","volume-title":"Proc. 32nd AAAI Conf. Artif. Intell., 30th Innov. Appl. Artif. Intell., 8th AAAI Symp. Educ. Adv. Artif. Intell. (EAAI)","author":"Li"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref40","first-page":"1","article-title":"Using randomized response for differential privacy preserving data collection","volume-title":"Proc. Workshops EDBT\/ICDT Joint Conf.","author":"Wang"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00053"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"ref45","first-page":"3697","article-title":"Geometric matrix completion with recurrent multi-graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Monti"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2856037"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124309"},{"key":"ref49","first-page":"1257","article-title":"Probabilistic matrix factorization","volume-title":"Proc. 20th Int. Conf. Neural Inf. Process. Syst.","author":"Salakhutdinov"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463028"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/11104234.pdf?arnumber=11104234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:43:19Z","timestamp":1754588599000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11104234\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3594145","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2025]]}}}