{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:14:09Z","timestamp":1740100449616,"version":"3.37.3"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"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":["2020YFB2009501"],"award-info":[{"award-number":["2020YFB2009501"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,17]]},"DOI":"10.1109\/ic-nidc54101.2021.9660520","type":"proceedings-article","created":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T20:36:16Z","timestamp":1641328576000},"page":"428-433","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving Verifiable Collaborative Learning with Chain Aggregation"],"prefix":"10.1109","author":[{"given":"Ming","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingxu","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanyu","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-020-00780-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3022911"},{"key":"ref12","first-page":"493","article-title":"Batchcrypt: Efficient homomorphic encryption for cross-silo federated learning [C]","author":"zhang","year":"2020","journal-title":"2020 USENIX Annual Technical Conference ( USENIX ATC"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2298\/CSIS190923022O"},{"key":"ref14","article-title":"Fed-EINI: An Efficient and Interpretable Inference Framework for Decision Tree Ensembles in Federated Learning [J]","author":"chen","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3438872.3439097"},{"key":"ref16","article-title":"Exploring private federated learning with laplacian smoothing [J]","author":"liang","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3068261"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5051"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2929409"},{"key":"ref4","article-title":"Advances and open problems in federated learning [J]","author":"kairouz","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2200\/S00960ED2V01Y201910AIM043"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/WorldS450073.2020.9210355"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054610"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref2","article-title":"Federated learning for mobile keyboard prediction [J]","author":"hard","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2501\/IJMR-2017-050"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.2986205"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148628"},{"key":"ref22","article-title":"On the convergence of fedavg on non-iid data [J]","author":"li","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.05.005"}],"event":{"name":"2021 7th IEEE International Conference on Network Intelligence and Digital Content (IC-NIDC)","start":{"date-parts":[[2021,11,17]]},"location":"Beijing, China","end":{"date-parts":[[2021,11,19]]}},"container-title":["2021 7th IEEE International Conference on Network Intelligence and Digital Content (IC-NIDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9660393\/9660398\/09660520.pdf?arnumber=9660520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:56:40Z","timestamp":1652201800000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9660520\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,17]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/ic-nidc54101.2021.9660520","relation":{},"subject":[],"published":{"date-parts":[[2021,11,17]]}}}