{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T12:05:41Z","timestamp":1789992341956,"version":"4.0.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"GRF","award":["HKUST 617713"],"award-info":[{"award-number":["HKUST 617713"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,2,1]]},"DOI":"10.1109\/tkde.2018.2827378","type":"journal-article","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T18:03:38Z","timestamp":1523901818000},"page":"315-328","source":"Crossref","is-referenced-by-count":5,"title":["Engineering Methods for Differentially Private Histograms: Efficiency Beyond Utility"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7558-5398","authenticated-orcid":false,"given":"Georgios","family":"Kellaris","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stavros","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882931"},{"key":"ref11","first-page":"1","article-title":"Differential privacy","author":"dwork","year":"2006","journal-title":"Proc 33rd Int Conf Automata Languages Programm"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1866739.1866758"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"ref14","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 Cryptographic Techn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374464"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806787"},{"key":"ref17","first-page":"363","article-title":"Private learning and sanitization: Pure versus approximate differential privacy","author":"beimel","year":"2013","journal-title":"APPROX-RANDOM"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.45"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732271"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/980972.980992"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.68"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920970"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.16"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989348"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556576"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.48"},{"key":"ref9","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"Proc Conf Theory of Cryptography"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.80"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807247"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350252"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488337"},{"key":"ref23","first-page":"2339","article-title":"A simple and practical algorithm for differentially private data release","author":"hardt","year":"2012","journal-title":"Proc 25th Int Conf Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253274"},{"key":"ref25","first-page":"275","article-title":"Optimal histograms with quality guarantees","author":"jagadish","year":"1998","journal-title":"Proc 24rd Int Conf Very Large Data Bases"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8606809\/08338405.pdf?arnumber=8338405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:12Z","timestamp":1657746852000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8338405\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,1]]},"references-count":27,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2827378","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,1]]}}}