{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T00:10:46Z","timestamp":1783383046322,"version":"3.54.6"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1422278"],"award-info":[{"award-number":["CCF-1422278"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005302","name":"University of Illinois at Urbana\u2013Champaign","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100005302","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1109\/tit.2015.2504972","type":"journal-article","created":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T14:07:01Z","timestamp":1449842821000},"page":"952-969","source":"Crossref","is-referenced-by-count":69,"title":["Optimal Noise Adding Mechanisms for Approximate Differential Privacy"],"prefix":"10.1109","volume":"62","author":[{"given":"Quan","family":"Geng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-642-28914-9_18","article-title":"Lower bounds in differential privacy","author":"de","year":"2012","journal-title":"Proc 9th Int Conf Theory Cryptograph (TCC)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"ref12","first-page":"289","article-title":"Privacy-preserving logistic regression","author":"chaudhuri","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"ref14","first-page":"703","article-title":"Differential privacy for functions and functional data","volume":"14","author":"hall","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref15","article-title":"A note on differential privacy: Defining resistance to arbitrary side information","volume":"abs 803 3946","author":"kasiviswanathan","year":"2008","journal-title":"CoRR"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_12"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497436"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536464"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.13"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.tm08651"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2425831"},{"key":"ref27","first-page":"1376","article-title":"The composition theorem for differential privacy","author":"kairouz","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875258"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"ref5","first-page":"486","article-title":"Our data, ourselves: Privacy via distributed noise generation","author":"dwork","year":"2006","journal-title":"Proc 24th Annu Int Conf Theory Appl Cryptograph Techn (EUROCRYPT)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488652"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806795"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/11681878_14","article-title":"Calibrating noise to sensitivity in private data analysis","volume":"3876","author":"dwork","year":"2006","journal-title":"Theory of Cryptography"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807105"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920970"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31680-7_9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.48"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"ref26","first-page":"1","article-title":"Differentially private online learning","author":"jain","year":"2012","journal-title":"Proc of the Annual Conf on Learning Theory (COLT)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7384825\/7353177.pdf?arnumber=7353177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:35Z","timestamp":1641987995000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7353177\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":28,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2504972","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2]]}}}