{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:07:20Z","timestamp":1784736440653,"version":"3.55.0"},"reference-count":56,"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"},{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"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.2504967","type":"journal-article","created":{"date-parts":[[2015,12,3]],"date-time":"2015-12-03T19:08:21Z","timestamp":1449169701000},"page":"925-951","source":"Crossref","is-referenced-by-count":138,"title":["The Optimal Noise-Adding Mechanism in 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":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_39"},{"key":"ref38","article-title":"Fast private data release algorithms for sparse queries","author":"blum","year":"2011"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835868"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2320765.2320816"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989348"},{"key":"ref30","first-page":"1","article-title":"Evaluating laplace noise addition to satisfy differential privacy for numeric data","volume":"4","author":"sarathy","year":"2011","journal-title":"Trans Data Privacy"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.90"},{"key":"ref36","first-page":"1","article-title":"Pan-private streaming algorithms","author":"dwork","year":"2010","journal-title":"Proc ICS"},{"key":"ref35","first-page":"361","article-title":"Differentially private m-estimators","author":"lei","year":"2011","journal-title":"Proc 23rd Annu Conf Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350253"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref27","article-title":"Geo-indistinguishability: Differential privacy for location-based systems","author":"andr\u00e9s","year":"2012"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382264"},{"key":"ref2","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":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806794"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993743"},{"key":"ref21","first-page":"152","article-title":"A practical application of differential privacy to personalized online advertising","author":"lindell","year":"2011","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806787"},{"key":"ref23","first-page":"289","article-title":"Privacy-preserving logistic regression","author":"chaudhuri","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.85"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989347"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/18.149501"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920970"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.07.004"},{"key":"ref55","article-title":"Work Session on Statistical Data Confidentiality","author":"soria-comas","year":"2011"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504972"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2425831"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"ref10","first-page":"1376","article-title":"The composition theorem for differential privacy","author":"kairouz","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.tm08651"},{"key":"ref40","article-title":"Differential privacy for the analyst via private equilibrium computation","author":"hsu","year":"2012"},{"key":"ref12","first-page":"2348","article-title":"A simple and practical algorithm for differentially private data release","author":"hardt","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.247"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2381966.2381978"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1810891.1810916"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265569"},{"key":"ref18","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 Cryptogr Techn (EUROCRYPT)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"ref4","first-page":"351","article-title":"The geometry of differential privacy: The sparse and approximate cases","author":"nikolov","year":"2012","journal-title":"Proc 45th Annu ACM Symp Theory Comput (STOC)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536464"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807105"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.13"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-642-11799-2_26","article-title":"Bounds on the sample complexity for private learning and private data release","volume":"5978","author":"beimel","year":"2010","journal-title":"Theory of Cryptography"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875258"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.14778\/3402707.3402749","article-title":"Private analysis of graph structure","volume":"4","author":"karwa","year":"2011","journal-title":"Proc VLDB Endowment"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_26"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.16"},{"key":"ref42","article-title":"Beyond worst-case analysis in private singular vector computation","author":"hardt","year":"2012"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.67"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-642-28914-9_19","article-title":"Iterative constructions and private data release","author":"gupta","year":"2012","journal-title":"Proc 9th Theory Cryptogr Conf"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.15"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7384825\/7345591-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7384825\/07345591.pdf?arnumber=7345591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:30Z","timestamp":1649444010000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7345591\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":56,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2504967","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2]]}}}