{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:51:51Z","timestamp":1755219111686,"version":"3.43.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437778","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"696-700","source":"Crossref","is-referenced-by-count":4,"title":["Preserving Privacy and Fidelity via Ehrhart Theory"],"prefix":"10.1109","author":[{"given":"Arun","family":"Padakandla","sequence":"first","affiliation":[{"name":"Purdue University"}]},{"given":"P. R.","family":"Kumar","sequence":"additional","affiliation":[{"name":"Texas A & M University"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[{"name":"Purdue University"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591877"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/09076828X"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6292-1"},{"journal-title":"Precise asymp-toties of Utility-Privacy tradeoff via Ehrhart Theory","year":"0","author":"padakandla","key":"ref13"},{"journal-title":"OEIS Sequence a103881","year":"0","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1997.0126"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2584610"},{"key":"ref3","article-title":"The Algorithmic Foundations of Differential Privacy","author":"dwork","year":"2014","journal-title":"Foundations and Trends\ufffd in Theoretical Computer Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541663"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504967"},{"key":"ref7","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 Theory Cryptogr Conf"},{"journal-title":"Computing the ContinuousDiscretely Integer-Point Enumeration in Polyhedra","year":"2015","author":"beck","key":"ref2"},{"key":"ref1","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"Proc of TCC"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504972"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437778.pdf?arnumber=8437778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:16Z","timestamp":1754502976000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437778\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437778","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}