{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T07:14:46Z","timestamp":1784099686047,"version":"3.55.0"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"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. Dependable and Secure Comput."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tdsc.2025.3568160","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T13:42:29Z","timestamp":1746711749000},"page":"5494-5507","source":"Crossref","is-referenced-by-count":1,"title":["On Estimating the Strength of Differentially Private Mechanisms in a Black-Box Setting"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8859-9844","authenticated-orcid":false,"given":"Daniele","family":"Gorla","sequence":"first","affiliation":[{"name":"Department of Computer Science, Sapienza University of Rome, Roma, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis","family":"Jalouzot","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ENS de Lyon, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0084-521X","authenticated-orcid":false,"given":"Federica","family":"Granese","sequence":"additional","affiliation":[{"name":"Inria & Université Côte d’Azur, Valbonne, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4597-7002","authenticated-orcid":false,"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[{"name":"Lix, Inria, Institute Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8717-2117","authenticated-orcid":false,"given":"Pablo","family":"Piantanida","sequence":"additional","affiliation":[{"name":"International Laboratory on Learning Systems (ILLS), Quebec AI Institute (MILA), Montréal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"ref2","article-title":"Learning with privacy at scale","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497436"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.5220\/0011885000003405"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-industry.60"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2018.00026"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3158146"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2014.36"},{"key":"ref14","first-page":"10:1","article-title":"Asymmetric distances for approximate differential privacy","volume-title":"Proc. 30th Int. Conf. Concurrency Theory","author":"Chistikov"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3360598"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863568"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009884"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CSF54842.2022.9919653"},{"key":"ref19","first-page":"1631","article-title":"Tight auditing of differentially private machine learning","volume-title":"Proc. 32nd USENIX Secur. Symp.","author":"Nasr"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_24"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636068"},{"key":"ref22","first-page":"2417","article-title":"Minimax optimal estimation of approximate differential privacy on neighboring databases","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref23","first-page":"22205","article-title":"Auditing differentially private machine learning: How private is private SGD?","volume-title":"Proc. Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Jagielski"},{"key":"ref24","first-page":"4165","article-title":"A general framework for auditing differentially private machine learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Lu"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00081"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833689"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00166"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/sp54263.2024.00134"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3616607"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0110"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134004"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/OJVT.2024.3360302"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29726-8_15"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.11.032"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17138-4_6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00031"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.privatenlp-1.1"},{"key":"ref38","article-title":"Directional privacy for deep learning","author":"Faustini","year":"2023"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.5220\/0011885000003405"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-023-02292-0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484734"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref44","article-title":"Truncated laplace and gaussian mechanisms of RDP","author":"Fu","year":"2023"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314619"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417282"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243863"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243818"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00073"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/springerreference_24224"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.53"},{"key":"ref52","first-page":"3571","article-title":"Collecting telemetry data privately","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ding"},{"key":"ref53","first-page":"547","article-title":"On measures of entropy and information","volume-title":"Proc. 4th Berkeley Symp. Math. Statist. Probability","author":"R\u00e9nyi"},{"issue":"2","key":"ref54","first-page":"169","article-title":"Statistical properties of sanitized results from differentially private laplace mechanism with univariate bounding constraints","volume":"1","author":"Liu","year":"2019","journal-title":"Trans. Data Priv."},{"issue":"35","key":"ref55","first-page":"58","article-title":"The truncated normal distribution","volume-title":"Dept. Sci. Comput. website, Florida State Univ.","volume":"1","author":"Burkardt","year":"2014"},{"key":"ref56","first-page":"17:1","article-title":"Extremal mechanisms for local differential privacy","volume":"17","author":"Kairouz","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.13"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-019-0686-2"},{"key":"ref59","first-page":"809","article-title":"Efficient direct density ratio estimation for non-stationarity adaptation and outlier detection","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kanamori"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E93.A.787"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/s10463-011-0343-8"},{"key":"ref62","first-page":"4521","article-title":"Trimmed density ratio estimation","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref63","first-page":"1320","article-title":"Lipschitz density-ratios, structured data, and data-driven tuning","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","author":"Kpotufe"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8858\/11150357\/10993470.pdf?arnumber=10993470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T18:53:06Z","timestamp":1757011986000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10993470\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":63,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2025.3568160","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}