{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T07:01:51Z","timestamp":1774422111447,"version":"3.50.1"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1109\/tifs.2025.3536277","type":"journal-article","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T19:14:22Z","timestamp":1738264462000},"page":"2836-2851","source":"Crossref","is-referenced-by-count":6,"title":["Differential Privacy With Higher Utility by Exploiting Coordinate-Wise Disparity: Laplace Mechanism Can Beat Gaussian in High Dimensions"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5909-8143","authenticated-orcid":false,"given":"Gokularam","family":"Muthukrishnan","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1530-0140","authenticated-orcid":false,"given":"Sheetal","family":"Kalyani","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988195"},{"key":"ref2","first-page":"93","article-title":"Revisiting differentially private linear regression: Optimal and adaptive prediction & estimation in unbounded domain","author":"Wang","year":"2018","journal-title":"Uncertainty in Artificial Intelligence"},{"issue":"3","key":"ref3","first-page":"1","article-title":"Differentially private empirical risk minimization","volume":"12","author":"Chaudhuri","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591883"},{"key":"ref5","first-page":"2518","article-title":"Private k-means clustering with stability assumptions","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Shechner"},{"key":"ref6","volume-title":"Disclosure Avoidance for the 2020 Census: An Introduction","year":"2021"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2283096"},{"key":"ref9","first-page":"394","article-title":"Improving the Gaussian mechanism for differential privacy: Analytical calibration and optimal denoising","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Balle"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12454"},{"key":"ref11","article-title":"Composition of differential privacy & privacy amplification by subsampling","author":"Steinke","year":"2022","journal-title":"arXiv:2210.00597"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2845388"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3185770"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3306159"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504967"},{"key":"ref16","first-page":"89","article-title":"Tight analysis of privacy and utility tradeoff in approximate differential privacy","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Geng"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504972"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2425831"},{"key":"ref19","first-page":"6270","article-title":"Differential privacy for symmetric log-concave mechanisms","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Vinterbo"},{"key":"ref20","first-page":"14759","article-title":"A central limit theorem for differentially private query answering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Dong"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0029"},{"key":"ref22","first-page":"14948","article-title":"Differentially private coordinate descent for composite empirical risk minimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mangold"},{"key":"ref23","first-page":"29937","article-title":"TAN without a burn: Scaling laws of DP-SGD","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sander"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488652"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384297"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2020.1773831"},{"key":"ref29","article-title":"PSI (\u03c8): A private data sharing interface","author":"Gaboardi","year":"2016","journal-title":"arXiv:1609.04340"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3433440"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_24"},{"key":"ref32","volume-title":"Introduction to Mathematical Statistics","author":"Hogg","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref35","first-page":"1226","article-title":"Subsampled R\u00e9nyi differential privacy and analytical moments accountant","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Wang"},{"key":"ref36","first-page":"4782","article-title":"Optimal accounting of differential privacy via characteristic function","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Zhu"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174015"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.726"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/03081088708817789"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350253"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11257-2_14"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1564"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref44","volume-title":"Numerical Analysis","author":"Burden","year":"2011"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511817106"},{"key":"ref46","first-page":"1","article-title":"Exploring the limits of differentially private deep learning with group-wise clipping","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"He"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68276-1"},{"key":"ref48","first-page":"145","article-title":"Some simple inequalities satisfied by convex functions","volume":"58","author":"Hardy","year":"1929","journal-title":"Messenger Math."},{"key":"ref49","article-title":"The optimal mechanism in differential privacy: Multidimensional setting","author":"Geng","year":"2013","journal-title":"arXiv:1312.0655"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(96)00140-X"},{"key":"ref51","volume-title":"Electricity Dataset"},{"key":"ref52","first-page":"38585","article-title":"Re-analyze Gauss: Bounds for private matrix approximation via Dyson Brownian motion","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Mangoubi"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2749215"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1034"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"ref56","first-page":"7634","article-title":"Poission subsampled R\u00e9nyi differential privacy","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhu"},{"key":"ref57","article-title":"R\u00e9nyi differential privacy of the sampled Gaussian mechanism","author":"Mironov","year":"2019","journal-title":"arXiv:1908.10530"},{"key":"ref58","first-page":"1","article-title":"Learning differentially private recurrent language models","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"McMahan"},{"key":"ref59","article-title":"A general approach to adding differential privacy to iterative training procedures","author":"McMahan","year":"2018","journal-title":"arXiv:1812.06210"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623142"},{"key":"ref61","first-page":"2560","article-title":"Computing tight differential privacy guarantees using FFT","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Koskela"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/10858760.pdf?arnumber=10858760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T04:59:54Z","timestamp":1742014794000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10858760\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3536277","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}