{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:31:53Z","timestamp":1766442713271,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,11,22]],"date-time":"2026-11-22T00:00:00Z","timestamp":1795305600000},"content-version":"vor","delay-in-days":368,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF 1900924, CCF 1901069, CCF 2007428"],"award-info":[{"award-number":["CCF 1900924, CCF 1901069, CCF 2007428"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765043","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:42:02Z","timestamp":1763854922000},"page":"1439-1453","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Algorithms for Verifying Differential Privacy with Gaussian Distributions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7522-5878","authenticated-orcid":false,"given":"Bishnu","family":"Bhusal","sequence":"first","affiliation":[{"name":"University of Missouri, Columbia, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1674-1650","authenticated-orcid":false,"given":"Rohit","family":"Chadha","sequence":"additional","affiliation":[{"name":"University of Missouri, Columbia, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8331-7912","authenticated-orcid":false,"given":"A. Prasad","family":"Sistla","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7977-0080","authenticated-orcid":false,"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158146"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-emnlp.425"},{"volume-title":"Proceedings of the IEEE Symposium on Logic in Computer Science. 141-154","author":"Barthe G.","key":"e_1_3_2_2_3_1","unstructured":"G. Barthe, R. Chadha, V. Jagannath, A.P. Sistla, and M. Viswanathan. 2020. Deciding Differential Privacy for Programs with finite inputs and outputs. In Proceedings of the IEEE Symposium on Logic in Computer Science. 141-154."},{"volume-title":"Proceedings of the ACM Symposium on the Principles of Programming Languages. 1-30","author":"Barthe G.","key":"e_1_3_2_2_4_1","unstructured":"G. Barthe, R. Chadha, P. Krogmeier, A.P. Sistla, and M. Viswanathan. 2021. Deciding accuracy of differentially private schemes. In Proceedings of the ACM Symposium on the Principles of Programming Languages. 1-30."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978371"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978391"},{"key":"e_1_3_2_2_7_1","first-page":"266","volume-title":"Proceedings of the 2014 IEEE 27th Computer Security Foundations Symposium (CSF14)","author":"Barthe G.","unstructured":"G. Barthe, M. Gaboardi, E.J. Arias, J. Hsu, C. Kunz, and P. Strub. 2014. Proving Differential Privacy in Hoare Logic. In Proceedings of the 2014 IEEE 27th Computer Security Foundations Symposium (CSF14). IEEE Computer Society, 266-277."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677000"},{"key":"e_1_3_2_2_9_1","first-page":"1","article-title":"A program logic for union bounds","volume":"107","author":"Barthe G.","year":"2016","unstructured":"G. Barthe, M. Gaboardi, B. Gr\u00e9goire, J. Hsu, and P. Strub. 2016c. A program logic for union bounds. In Proceedings of the International Colloquium on Automata, Languages, and Programming. 107:1-1-7:15.","journal-title":"Proceedings of the International Colloquium on Automata, Languages, and Programming."},{"volume-title":"Proceedings of the IEEE Symposium on Logic in Computer Science. 749-758","author":"Barthe G.","key":"e_1_3_2_2_10_1","unstructured":"G. Barthe, M. Gaboardi, B. Gr\u00e9goire, J. Hsu, and P. Strub. 2016 d. Proving differential privacy via probabilistic couplings. In Proceedings of the IEEE Symposium on Logic in Computer Science. 749-758."},{"volume-title":"Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 97-110","author":"Barthe G.","key":"e_1_3_2_2_11_1","unstructured":"G. Barthe, B. K\u00f6pf, F. Olmedo, and S.Z. B\u00e9guelin. 2012. Probabilistic reasoning for differential privacy. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 97-110."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492061"},{"key":"e_1_3_2_2_13_1","unstructured":"David Beazley. 2022. GitHub - dabeaz\/ply: Python Lex-Yacc -- github.com. https:\/\/github.com\/dabeaz\/ply. [Accessed 24-Jan-2023]."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.4064\/am33-2-7"},{"key":"e_1_3_2_2_15_1","volume-title":"Approximate Algorithms for Verifying Differential Privacy with Gaussian Distributions. CoRR","author":"Bhusal Bishnu","year":"2025","unstructured":"Bishnu Bhusal, Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan. 2025a. Approximate Algorithms for Verifying Differential Privacy with Gaussian Distributions. CoRR (2025)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.16945576"},{"volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security. 508-524","author":"Bichsel Benjamin","key":"e_1_3_2_2_17_1","unstructured":"Benjamin Bichsel, Timon Gehr, Dana Drachsler-Cohen, Petar Tsankov, and Martin T. Vechev. 2018. DP-Finder: Finding Differential Privacy Violations by Sampling and Optimization. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security. 508-524."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF54842.2022.9919653"},{"volume-title":"Proceedings of the IEEE Symposium on Logic in Computer Science. 1-13","author":"Chadha R.","key":"e_1_3_2_2_19_1","unstructured":"R. Chadha, A.P. Sistla, and M. Viswanathan. 2021. On Linear time decidability of differential privacy for programs with unbounded inputs. In Proceedings of the IEEE Symposium on Logic in Computer Science. 1-13."},{"volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security. 1761-1775","author":"Chadha R.","key":"e_1_3_2_2_20_1","unstructured":"R. Chadha, A.P. Sistla, M. Viswanathan, and B. Bhusal. 2023. Deciding Differential Privacy of Online Algorithms with Multiple Variables. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security. 1761-1775."},{"key":"e_1_3_2_2_21_1","volume-title":"Generalized Bisimulation Metrics. In 35th International Conference on Concurrency Theory (CONCUR). 32-46","author":"Chatzikokolakis Konstantinos","year":"2014","unstructured":"Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, and Lili Xu. 2014. Generalized Bisimulation Metrics. In 35th International Conference on Concurrency Theory (CONCUR). 32-46."},{"key":"e_1_3_2_2_22_1","volume-title":"On the privacy properties of variants on the sparse vector technique. arXiv preprint arXiv:1508.07306","author":"Chen Yan","year":"2015","unstructured":"Yan Chen and Ashwin Machanavajjhala. 2015. On the privacy properties of variants on the sparse vector technique. arXiv preprint arXiv:1508.07306 (2015)."},{"key":"e_1_3_2_2_23_1","volume-title":"The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory (CONCUR) (LIPIcs)","volume":"171","author":"Chistikov D.","unstructured":"D. Chistikov, S. Kiefer, A. S. Murawski, and D. Purser. 2020. The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory (CONCUR) (LIPIcs), Vol. 171. 41:1-41:19."},{"volume-title":"Proceedings of the International Conference on Management of Data. 1655-1658","author":"Cormode G.","key":"e_1_3_2_2_24_1","unstructured":"G. Cormode, S. Jha, T. Kulkarni, N. Li, D. Srivastava, and T. Wang. 2018. Privacy at Scale: Local Differential Privacy in Practice. In Proceedings of the International Conference on Management of Data. 1655-1658."},{"volume-title":"The igraph software package for complex network research. InterJournal","author":"Csardi Gabor","key":"e_1_3_2_2_25_1","unstructured":"Gabor Csardi and Tamas Nepusz. 2006. The igraph software package for complex network research. InterJournal, Vol. Complex Systems (2006), 1695. https:\/\/igraph.org"},{"key":"e_1_3_2_2_26_1","volume-title":"Really Natural Linear Indexed Type Checking. In 26th 2014 International Symposium on Implementation and Application of Functional Languages (IFL). 5:1-5:12","author":"de Amorim Arthur Azevedo","year":"2014","unstructured":"Arthur Azevedo de Amorim, Marco Gaboardi, Emilio Jes\u00fas Gallego Arias, and Justin Hsu. 2014. Really Natural Linear Indexed Type Checking. In 26th 2014 International Symposium on Implementation and Application of Functional Languages (IFL). 5:1-5:12."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785715"},{"key":"e_1_3_2_2_28_1","unstructured":"Apple Differential Privacy Team. 2017. Learning with privacy at scale."},{"key":"e_1_3_2_2_29_1","first-page":"3571","article-title":"Collecting Telemetry Data Privately","volume":"30","author":"Ding Bolin","year":"2017","unstructured":"Bolin Ding, Janardhan Kulkarni, and Sergey Yekhanin. 2017. Collecting Telemetry Data Privately. In Advances in Neural Information Processing Systems 30. 3571-3580.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243818"},{"volume-title":"Proceedings of the International Conference on Theory of Cryptography. 265-284","author":"Dwork C.","key":"e_1_3_2_2_31_1","unstructured":"C. Dwork, F. McSherry, K. Nissim, and A. Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Proceedings of the International Conference on Theory of Cryptography. 265-284."},{"volume-title":"Proceedings of the ACM Symposium on Theory of Computation. 381-390","author":"Dwork C.","key":"e_1_3_2_2_32_1","unstructured":"C. Dwork, M. Naor, O. Reingold, G. Rothblum, and S. Vadhan. 2009a. On the complexity of differentially private data release: Efficient algorithms and hardness results. In Proceedings of the ACM Symposium on Theory of Computation. 381-390."},{"volume-title":"Proceedings of the Annual ACM Symposium on Theory of Computing (STOC). 381-390","author":"Dwork Cynthia","key":"e_1_3_2_2_33_1","unstructured":"Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, and Salil P. Vadhan. 2009b. On the complexity of differentially private data release: efficient algorithms and hardness results. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC). 381-390."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"volume-title":"Proceedings of the ACM SIGSAC conference on computer and communications security. 1054-1067","author":"Erlingsson U.","key":"e_1_3_2_2_35_1","unstructured":"U. Erlingsson, V. Pihur, and A. Korolova. 2014. Rappor: Randomized aggregatable privacy-preserving ordinal response. In Proceedings of the ACM SIGSAC conference on computer and communications security. 1054-1067."},{"volume-title":"Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 357-370","author":"Gaboardi M.","key":"e_1_3_2_2_36_1","unstructured":"M. Gaboardi, A. Haeberlen, J. Hsu, A. Narayan, and B.C. Pierce. 2013. Linear Dependent Types for Differential Privacy. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 357-370."},{"key":"e_1_3_2_2_37_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming (ICALP) (LIPIcs)","volume":"168","author":"Gaboardi Marco","year":"2020","unstructured":"Marco Gaboardi, Kobbi Nissim, and David Purser. 2020. The Complexity of Verifying Loop-Free Programs as Differentially Private. In 47th International Colloquium on Automata, Languages, and Programming (ICALP) (LIPIcs), Vol. 168. 129:1-129:17."},{"volume-title":"Proceedings of the International Conference on Theory of Cryptography. 339-356","author":"Gupta A.","key":"e_1_3_2_2_38_1","unstructured":"A. Gupta, A. Roth, and J. Ullman. 2012. Iterative constructions and provate data release. In Proceedings of the International Conference on Theory of Cryptography. 339-356."},{"volume-title":"Proceedings of the IEEE Symposium on the Foundations of Computer Science. 61-70","author":"Hardt M.","key":"e_1_3_2_2_39_1","unstructured":"M. Hardt and G.N. Rothblum. 2010. A multiplicative weights mechanism for privacy-preserving data analysis. In Proceedings of the IEEE Symposium on the Foundations of Computer Science. 61-70."},{"volume-title":"Complexity Theory of Real Functions","author":"K.-I. Ko.","key":"e_1_3_2_2_40_1","unstructured":"K.-I. Ko. 1991. Complexity Theory of Real Functions. Birkhauser."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02768-1_21"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055331"},{"volume-title":"Proceedings of the IEEE International Conference on Data Engineering. 277-286","author":"Machanavajjhala A.","key":"e_1_3_2_2_43_1","unstructured":"A. Machanavajjhala, D. Kifer, J. Abowd, J. Gehrke, and L. Vilhuber. 2008. Privacy: From theory to practice on the map. In Proceedings of the IEEE International Conference on Data Engineering. 277-286."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data. 349\u2013360","author":"Mohan P.","key":"e_1_3_2_2_45_1","unstructured":"P. Mohan, A. Thakurta, E. Shi, D. Song, and E. Culler. 2012. Gupt: Privacy preserving data analysis made easy. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 349\u2013360."},{"volume-title":"Proceedings of the ACM SIGPLAN International Conference on Functional Programming. 157-168","author":"Reed J.","key":"e_1_3_2_2_46_1","unstructured":"J. Reed and B.C. Pierce. 2010. Distance makes the types grow stronger: A calculus for differential privacy. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming. 157-168."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3720446"},{"volume-title":"Proceedings of the USENIX Conference on Networked Systems Design and Implementation. 20","author":"Roy I.","key":"e_1_3_2_2_48_1","unstructured":"I. Roy, S. Setty, A. Kilzer, V. Shmatikov, and E. Witchel. 2010. Airavat: Security and privacy for MapReduce. In Proceedings of the USENIX Conference on Networked Systems Design and Implementation. 20."},{"key":"e_1_3_2_2_49_1","volume-title":"Archive of Formal Proofs (January","author":"Sato Tetsuya","year":"2025","unstructured":"Tetsuya Sato and Yasuhiko Minamide. 2025a. Differential Privacy. Archive of Formal Proofs (January 2025). https:\/\/isa-afp.org\/entries\/Differential_Privacy.html, Formal proof development."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3703595.3705875"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290352"},{"key":"e_1_3_2_2_52_1","volume-title":"FLINT: Fast Library for Number Theory. Version 3.0.0, https:\/\/flintlib.org.","author":"The FLINT","year":"2023","unstructured":"The FLINT team. 2023. FLINT: Fast Library for Number Theory. Version 3.0.0, https:\/\/flintlib.org."},{"key":"e_1_3_2_2_53_1","first-page":"594","article-title":"Learning new words","volume":"9","author":"Thakurta A.G.","year":"2017","unstructured":"A.G. Thakurta, A.H. Vyrros, U.S. Vaishampayan, G. Kapoor, J. Freudiger, V.R. Sridhar, and D. Davidson. 2017. Learning new words. US Patent 9,594,741.","journal-title":"US Patent"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.015"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417282"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314619"},{"key":"e_1_3_2_2_57_1","first-page":"266","volume-title":"LightDP: Towards Automating Differential Privacy Proofs. In 44th ACM Symposium on Principles of Programming Languages (POPL17)","author":"Zhang D.","unstructured":"D. Zhang and D. Kifer. 2017. LightDP: Towards Automating Differential Privacy Proofs. In 44th ACM Symposium on Principles of Programming Languages (POPL17). Association for Computing Machinery, 266-277."},{"key":"e_1_3_2_2_58_1","volume-title":"Improving sparse vector technique with renyi differential privacy. Advances in neural information processing systems","author":"Zhu Yuqing","year":"2020","unstructured":"Yuqing Zhu and Yu-Xiang Wang. 2020. Improving sparse vector technique with renyi differential privacy. Advances in neural information processing systems, Vol. 33 (2020), 20249-20258."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765043","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:27:20Z","timestamp":1766442440000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":58,"alternative-id":["10.1145\/3719027.3765043","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765043","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}