{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T23:20:03Z","timestamp":1781306403351,"version":"3.54.1"},"reference-count":202,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":["2023YFB2704400"],"award-info":[{"award-number":["2023YFB2704400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"RGC GRF","award":["15200321"],"award-info":[{"award-number":["15200321"]}]},{"name":"RGC GRF","award":["15201322"],"award-info":[{"award-number":["15201322"]}]},{"name":"RGC GRF","award":["15230624"],"award-info":[{"award-number":["15230624"]}]},{"DOI":"10.13039\/501100003452","name":"Innovation and Technology Commission","doi-asserted-by":"crossref","award":["ITF-ITS\/056\/22MX"],"award-info":[{"award-number":["ITF-ITS\/056\/22MX"]}],"id":[{"id":"10.13039\/501100003452","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003452","name":"Innovation and Technology Commission","doi-asserted-by":"crossref","award":["ITS\/052\/23MX"],"award-info":[{"award-number":["ITS\/052\/23MX"]}],"id":[{"id":"10.13039\/501100003452","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004377","name":"Hong Kong Polytechnic University","doi-asserted-by":"publisher","award":["1-CDKK"],"award-info":[{"award-number":["1-CDKK"]}],"id":[{"id":"10.13039\/501100004377","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004377","name":"Hong Kong Polytechnic University","doi-asserted-by":"publisher","award":["G-SAC8"],"award-info":[{"award-number":["G-SAC8"]}],"id":[{"id":"10.13039\/501100004377","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["ECCS-2302469"],"award-info":[{"award-number":["ECCS-2302469"]}]},{"name":"NSF","award":["CMMI-2222810"],"award-info":[{"award-number":["CMMI-2222810"]}]},{"DOI":"10.13039\/501100004405","name":"Toyota Motor Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004405","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Amazon"},{"name":"Japan Science and Technology Agency (JST) Adopting Sustainable Partnerships for Innovative Research Ecosystem","award":["JPMJAP2326"],"award-info":[{"award-number":["JPMJAP2326"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Surv. Tutorials"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/comst.2025.3558755","type":"journal-article","created":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T13:23:53Z","timestamp":1744291433000},"page":"2457-2496","source":"Crossref","is-referenced-by-count":7,"title":["A Survey on Federated Analytics: Taxonomy, Enabling Techniques, Applications and Open Issues"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9554-6695","authenticated-orcid":false,"given":"Zibo","family":"Wang","sequence":"first","affiliation":[{"name":"UM-SJTU Joint Institute, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haichao","family":"Ji","sequence":"additional","affiliation":[{"name":"UM-SJTU Joint Institute, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4352-6507","authenticated-orcid":false,"given":"Yifei","family":"Zhu","sequence":"additional","affiliation":[{"name":"UM-SJTU Joint Institute and the Cooperative Medianet Innovation Center, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0921-2726","authenticated-orcid":false,"given":"Dan","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6606-5822","authenticated-orcid":false,"given":"Zhu","family":"Han","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Houston, Houston, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Number of connected IoT devices will surge to 125 billion by 2030.","year":"2024"},{"key":"ref2","volume-title":"The growth in connected IoT devices is expected to generate 79.4ZB of data in 2025, according to a new IDC forecast.","year":"2024"},{"key":"ref3","volume-title":"Regulation (EU) 2016\/679 of the European parliament and of the council","year":"2024"},{"key":"ref4","volume-title":"California consumer privacy act","year":"2024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3522561"},{"issue":"1","key":"ref6","first-page":"9","article-title":"Federated computing: Query, learning, and beyond","volume":"46","author":"Tong","year":"2023","journal-title":"IEEE Data Eng. Bull."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-023-07438-w"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3075439"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2986024"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3460427"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106775"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3090430"},{"key":"ref13","volume-title":"Federated analytics: Collaborative data science without data collection","year":"2020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS52092.2021.9521301"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3015958"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-25972-y"},{"issue":"1","key":"ref17","doi-asserted-by":"crossref","first-page":"162","DOI":"10.56553\/popets-2022-0104","article-title":"Towards sparse federated analytics: Location heatmaps under distributed differential privacy with secure aggregation","volume":"2022","author":"Bagdasaryan","year":"2022","journal-title":"Proc. Privacy Enhanc. Technol."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2017.02.001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2820162"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3062546"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.101.2100328"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1561\/116.00000063"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/OJCS.2020.2996184"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.001.2100261"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796719"},{"key":"ref27","first-page":"2611","article-title":"Heterogeneity for the win: One-shot federated clustering","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dennis"},{"key":"ref28","first-page":"3837","article-title":"Federated heavy hitters discovery with differential privacy","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Zhu"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3098692"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560631"},{"key":"ref31","article-title":"Bit-efficient numerical aggregation and stronger privacy for trust in federated analytics","author":"Cormode","year":"2021","journal-title":"arXiv:2108.01521"},{"key":"ref32","first-page":"3571","article-title":"Collecting telemetry data privately","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ding"},{"key":"ref33","article-title":"Collecting and analyzing data from smart device users with local differential privacy","author":"Nguy\u00ean","year":"2016","journal-title":"arXiv:1606.05053"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00018"},{"key":"ref35","article-title":"FastSecAgg: Scalable secure aggregation for privacy-preserving federated learning","author":"Kadhe","year":"2020","journal-title":"arXiv:2009.11248"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054610"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359660"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417885"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9059-9"},{"key":"ref41","first-page":"386","article-title":"Secure computation of the kth-ranked element in a star network","volume-title":"Financial Cryptography","author":"Tueno","year":"2020"},{"key":"ref42","article-title":"Differentially private federated learning: A client level perspective","author":"Geyer","year":"2017","journal-title":"arXiv:1712.07557"},{"key":"ref43","first-page":"1","article-title":"Learning differentially private recurrent language models","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"McMahan"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2991416"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3056991"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413764"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685644"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539308"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3047124"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3381832"},{"key":"ref51","first-page":"2147","article-title":"Secure multi-party computation of differentially private median","volume-title":"Proc. USENIX Secur. Symp.","author":"B\u00f6hler"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3192874"},{"key":"ref53","first-page":"694","article-title":"LightSecAgg: A lightweight and versatile design for secure aggregation in federated learning","volume-title":"Proc. Mach. Learn. Syst.","author":"So"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3163592"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414474"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2672684"},{"key":"ref57","first-page":"14461","article-title":"Orchestra: Unsupervised federated learning via globally consistent clustering","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lubana"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3213777"},{"key":"ref59","first-page":"1","article-title":"Federated unsupervised clustering with generative models","volume-title":"Proc. AAAI Int. Workshop Trustable Verifiable Auditable Federated Learn.","author":"Chung"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9348203"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746632"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978409"},{"key":"ref63","first-page":"1120","article-title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Acharya"},{"key":"ref64","first-page":"51","article-title":"Communication complexity in locally private distribution estimation and heavy hitters","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Acharya"},{"key":"ref65","volume-title":"Learning with privacy at scale","year":"2024"},{"issue":"16","key":"ref66","first-page":"1","article-title":"Practical locally private heavy hitters","volume":"21","author":"Bassily","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/SaTML59370.2024.00032"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00035"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557327"},{"key":"ref70","first-page":"1420","article-title":"Sample-and-threshold differential privacy: Histograms and applications","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Cormode"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484557"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621294"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00048"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055334"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303982"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452808"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407854"},{"key":"ref78","first-page":"2129","article-title":"Senate: A maliciously-secure MPC platform for collaborative analytics","volume-title":"Proc. USENIX Secur. Symp.","author":"Poddar"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3222415"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.14778\/3514061.3514064"},{"key":"ref81","first-page":"1065","article-title":"Orchard: Differentially private analytics at scale","volume-title":"Proc. USENIX Symp. Oper. Syst. Des. Implement.","author":"Roth"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483585"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1145\/3600006.3624566"},{"key":"ref84","first-page":"10351","article-title":"Towards understanding biased client selection in federated learning","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Cho"},{"key":"ref85","first-page":"954","article-title":"CMFL: Mitigating communication overhead for federated learning","volume-title":"Proc. IEEE Int. Conf. Distrib. Comput. Syst.","author":"Luping"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20785"},{"key":"ref87","first-page":"19","article-title":"Oort: Efficient federated learning via guided participant selection","volume-title":"Proc. USENIX Symp. Oper. Syst. Des. Implement.","author":"Lai"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110813"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN48605.2020.9207469"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3192506"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2022.3231527"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155494"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148625"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45855.2022.9838256"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500608"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10279460"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/ICCWorkshops57953.2023.10283725"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1109\/ICCWorkshops49005.2020.9145090"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45855.2022.9839007"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2899387"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1145\/3411495.3421352"},{"key":"ref103","article-title":"Investigating trade-offs in utility, fairness and differential privacy in neural networks","author":"Pannekoek","year":"2021","journal-title":"arXiv:2102.05975"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0058"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"ref106","first-page":"1811","article-title":"Communication\u2013computation trade-offs in PIR","volume-title":"Proc. USENIX Secur. Symp.","author":"Ali"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796841"},{"key":"ref109","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"McMahan"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/infocom.2018.8486221"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10279635"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2961673"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10278624"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621227"},{"key":"ref115","first-page":"1","article-title":"Dominant resource fairness: Fair allocation of multiple resource types","volume-title":"Proc. USENIX Symp. Netw. Syst. Des. Implement.","author":"Ghodsi"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3231786"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228953"},{"key":"ref118","article-title":"Cohere: Managing differential privacy in large scale systems","author":"K\u00fcchler","year":"2023","journal-title":"arXiv:2301.08517"},{"key":"ref119","first-page":"55","article-title":"Privacy budget scheduling","volume-title":"Proc. USENIX Symp. Oper. Syst. Des. Implement. (OSDI)","author":"Luo"},{"key":"ref120","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst.","author":"Bonawitz"},{"key":"ref121","article-title":"Federated learning with non-iid data","author":"Zhao","year":"2018","journal-title":"arXiv:1806.00582"},{"key":"ref122","first-page":"1","article-title":"On the convergence of FedAvg on non-IID data","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Li"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2944481"},{"key":"ref124","first-page":"5132","article-title":"SCAFFOLD: Stochastic controlled averaging for federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174297"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3301330"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3085429"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3319657"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3241090"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3308714"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3190377"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.41"},{"key":"ref134","first-page":"267","article-title":"The secret sharer: Evaluating and testing unintended memorization in neural networks","volume-title":"Proc. USENIX Secur. Symp.","author":"Carlini"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17330"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"ref138","first-page":"1","article-title":"Privacy-preserving aggregation of time-series data","volume-title":"Proc. Annu. Netw. Distrib. Syst. Secur. Symp.","author":"Shi"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2484326"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref142","article-title":"Concentrated differential privacy","author":"Dwork","year":"2016","journal-title":"arXiv:1603.01887"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23279"},{"key":"ref144","first-page":"155","article-title":"Sample complexity bounds for differentially private learning","volume-title":"Proc. Annu. Conf. Learn. Theory","author":"Chaudhuri"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476277"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_26"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516735"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371856"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213571"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588581"},{"key":"ref151","volume-title":"Protecting Privacy When Disclosing Information: K-Anonymity and Its Enforcement Through Generalization and Suppression","author":"Samarati","year":"1998"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2023.102193"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00922-2"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1145\/3131672.3131697"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2981239"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17277-0_9"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9190-0"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref164","first-page":"1","article-title":"Private set intersection: Are garbled circuits better than custom protocols?","volume-title":"Proc. Netw. Distrib. Syst. Secur. Symp.","author":"Huang"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133979"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"ref169","first-page":"2723","article-title":"CEREBRO: A platform for multi-party cryptographic collaborative learning","volume-title":"Proc. USENIX Secur. Symp.","author":"Zheng"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3118347"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749443"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375599"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247513"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1145\/3080008"},{"key":"ref175","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414506"},{"key":"ref177","article-title":"Fast private set operations with SEPIA","author":"Many","year":"2012"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"ref179","first-page":"797","article-title":"Faster private set intersection based on OT extension","volume-title":"Proc. USENIX Secur. Symp.","author":"Pinkas"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_13"},{"key":"ref182","article-title":"A field guide to federated optimization","author":"Wang","year":"2021","journal-title":"arXiv:2107.06917"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3055559"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2021.3063517"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2023.3316643"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91631-2_13"},{"issue":"2","key":"ref187","first-page":"78","article-title":"Simple random sampling","volume":"1","author":"Noor","year":"2022","journal-title":"Int. J. Educ. Lang. Stud."},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00536"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2022.3190835"},{"key":"ref190","article-title":"Differentiable deep clustering with cluster size constraints","author":"Genevay","year":"2019","journal-title":"arXiv:1910.09036"},{"key":"ref191","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3160699"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00204"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526190"},{"key":"ref194","first-page":"519","article-title":"Poisoning attacks to local differential privacy protocols for key-value data","volume-title":"Proc. USENIX Secur. Symp.","author":"Wu"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00063"},{"key":"ref196","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2022.3184593"},{"key":"ref197","article-title":"Comverse: A federative-by-design platform for community computing","author":"Fu","year":"2023","journal-title":"arXiv:2308.15219"},{"key":"ref198","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2018.8599856"},{"key":"ref199","doi-asserted-by":"publisher","DOI":"10.1109\/ICCWorkshops57953.2023.10283588"},{"key":"ref200","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10278671"},{"key":"ref201","first-page":"23034","article-title":"ProgFed: Effective, communication, and computation efficient federated learning by progressive training","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref202","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3088528"}],"container-title":["IEEE Communications Surveys &amp; Tutorials"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9739\/11321210\/10960683-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9739\/11321210\/10960683.pdf?arnumber=10960683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T18:18:30Z","timestamp":1767377910000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10960683\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":202,"URL":"https:\/\/doi.org\/10.1109\/comst.2025.3558755","relation":{},"ISSN":["1553-877X","2373-745X"],"issn-type":[{"value":"1553-877X","type":"electronic"},{"value":"2373-745X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}