{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:05:28Z","timestamp":1775228728151,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102133"],"award-info":[{"award-number":["62102133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Kaifeng Science and Technology Major Project","award":["21ZD011"],"award-info":[{"award-number":["21ZD011"]}]},{"name":"Ji\u2019An Finance and Science Foundation","award":["[2022]4"],"award-info":[{"award-number":["[2022]4"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cogn. Commun. Netw."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1109\/tccn.2023.3284548","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T17:27:28Z","timestamp":1686331648000},"page":"1322-1339","source":"Crossref","is-referenced-by-count":6,"title":["Performance Optimization for Noise Interference Privacy Protection in Federated Learning"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3108-123X","authenticated-orcid":false,"given":"Zihao","family":"Peng","sequence":"first","affiliation":[{"name":"School of Mathematics and Computer Science, Nanchang University, Nanchang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boyuan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan University, Kaifeng, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan University, Kaifeng, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9026-8128","authenticated-orcid":false,"given":"Shengbo","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan University, Kaifeng, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9275-8323","authenticated-orcid":false,"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software and the Henan International Joint Laboratory of Intelligent Network Theory and Key Technology, Henan University, Kaifeng, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7467-7108","authenticated-orcid":false,"given":"Hong","family":"Rao","sequence":"additional","affiliation":[{"name":"School of Software, Nanchang University, Nanchang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3148-4453","authenticated-orcid":false,"given":"Cong","family":"Shen","sequence":"additional","affiliation":[{"name":"Charles L. Brown Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption","author":"hardy","year":"2017","journal-title":"arXiv 1711 10677"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.10.007"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17277-0_9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/72.377972"},{"key":"ref14","first-page":"493","article-title":"BatchCrypt: Efficient homomorphic encryption for cross-silo federated learning","author":"zhang","year":"2020","journal-title":"Proc Annu Tech Conf"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(88)90003-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-019-00869-2"},{"key":"ref30","first-page":"2521","article-title":"Shuffled model of differential privacy in federated learning","author":"girgis","year":"2021","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2203\/1\/012048"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00065"},{"key":"ref32","first-page":"26048","article-title":"Understanding clipping for federated learning: Convergence and client-level differential privacy","author":"zhang","year":"2022","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SEC54971.2022.00015"},{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"Proc Artif Intell Statist"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3338501.3357370"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10187"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref38","article-title":"Adadelta: An adaptive learning rate method","author":"zeiler","year":"2012","journal-title":"arXiv 1212 5701"},{"key":"ref19","article-title":"Learning differentially private recurrent language models","author":"mcmahan","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref18","article-title":"Differentially private federated learning: A client level perspective","author":"geyer","year":"2017","journal-title":"arXiv 1712 07557"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174426"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3056991"},{"key":"ref45","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3037194"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3338501.3357371"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref42","article-title":"Local SGD converges fast and communicates little","author":"stich","year":"2018","journal-title":"arXiv 1805 09767"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3118402"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/217"},{"key":"ref44","article-title":"Adaptive federated optimization","author":"reddi","year":"2020","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00081"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015693"},{"key":"ref28","article-title":"Protection against reconstruction and its applications in private federated learning","author":"bhowmick","year":"2018","journal-title":"arXiv 1812 00984"},{"key":"ref27","article-title":"Differential privacy-enabled federated learning for sensitive health data","author":"choudhury","year":"2019","journal-title":"arXiv 1910 02578"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413764"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3000372"},{"key":"ref7","first-page":"16937","article-title":"Inverting gradients-how easy is it to break privacy in federated learning?","volume":"33","author":"geiping","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737416"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00101"},{"key":"ref3","article-title":"Service delay minimization for federated learning over mobile devices","author":"chen","year":"2022","journal-title":"arXiv 2205 09868"},{"key":"ref6","first-page":"14747","article-title":"Deep leakage from gradients","volume":"32","author":"zhu","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","article-title":"Delay minimization for federated learning over wireless communication networks","author":"yang","year":"2020","journal-title":"arXiv 2007 03462"},{"key":"ref40","first-page":"5132","article-title":"SCAFFOLD: Stochastic controlled averaging for federated learning","author":"karimireddy","year":"2020","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Cognitive Communications and Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687307\/10272990\/10147264.pdf?arnumber=10147264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T19:27:56Z","timestamp":1698694076000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10147264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":45,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tccn.2023.3284548","relation":{},"ISSN":["2332-7731","2372-2045"],"issn-type":[{"value":"2332-7731","type":"electronic"},{"value":"2372-2045","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]}}}