{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T22:54:48Z","timestamp":1772664888754,"version":"3.50.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tifs.2021.3097822","type":"journal-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T21:35:16Z","timestamp":1629840916000},"page":"4451-4465","source":"Crossref","is-referenced-by-count":7,"title":["Privacy-Preserving Boosting in the Local Setting"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8457-9571","authenticated-orcid":false,"given":"Sen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0660-7191","authenticated-orcid":false,"given":"J. Morris","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809790"},{"key":"ref38","first-page":"2436","article-title":"Discrete distribution estimation under local privacy","author":"kairouz","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref33","first-page":"555","article-title":"Learning privately from multiparty data","author":"hamm","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref32","first-page":"1","article-title":"Multiparty differential privacy via aggregation of locally trained classifiers","author":"pathak","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-2004-11-210"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2016.7899632"},{"key":"ref37","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"Proc Theory Cryptogr Conf"},{"key":"ref36","year":"2019","journal-title":"Integrated Public Use Microdata Series"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2995058"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3233\/WEB-180374"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1273221.1273222"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00035"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"ref13","article-title":"Differential privacy and machine learning: A survey and review","author":"ji","year":"2014","journal-title":"arXiv 1412 7584 [cs]"},{"key":"ref14","first-page":"429","article-title":"Local privacy and statistical minimax rates","author":"duchi","year":"2013","journal-title":"Proc IEEE Ann Symp Foundations of Computer Science (FOCS)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.09.010"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486352"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5422"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.4310\/SII.2009.v2.n3.a8"},{"key":"ref28","first-page":"1","article-title":"Using validation sets to avoid overfitting in AdaBoost","author":"bylander","year":"2006","journal-title":"Proc FLAIRS Conf"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2015.10"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116037"},{"key":"ref6","article-title":"Text mining with decision trees and decision rules","author":"apte","year":"1998","journal-title":"Proc Conf Automated Learn Discorery Workshop 6 Learn Text Web"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.10.022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80023-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.02.017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0034-4257(03)00132-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MSEC.2018.2888775"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/34.58871"},{"key":"ref46","first-page":"14774","article-title":"Deep leakage from gradients","author":"zhu","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref20","author":"tan","year":"2018","journal-title":"Introduction to Data Mining"},{"key":"ref45","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":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00029"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/sam.10006"},{"key":"ref42","article-title":"Clustering algorithms for the centralized and local models","author":"nissim","year":"2017","journal-title":"arXiv 1707 04766"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA49011.2020.00081"},{"key":"ref23","first-page":"729","article-title":"Locally differentially private protocols for frequency estimation","author":"wang","year":"2017","journal-title":"Proc 26th USENIX Secur Symp"},{"key":"ref44","article-title":"Differentially-private ‘draw and discard’ machine learning","author":"pihur","year":"2018","journal-title":"arXiv 1807 04369"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.215"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00063"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/9151439\/09489291.pdf?arnumber=9489291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:37Z","timestamp":1652194357000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9489291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/tifs.2021.3097822","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}