{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,31]],"date-time":"2026-08-31T04:14:04Z","timestamp":1788149644142,"version":"build-2803163510"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Karlsruher Institut f\u00fcr Technologie (KIT)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Softw Syst Model"],"published-print":{"date-parts":[[2026,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Data anonymization methods gain legal importance as data collection and analysis are expanding dramatically in data management and statistical research. Yet applying anonymization, or understanding how well a given analytics program hides sensitive information, is non-trivial. Privug is a method to quantify privacy risks of data analytics programs by analyzing their source code. The method uses probability distributions to model attacker knowledge and Bayesian inference to update said knowledge based on observable outputs. Currently, Privug is equipped with approximate Bayesian inference methods (such as Markov Chain Monte Carlo), and an exact Bayesian inference method based on multivariate Gaussian distributions. This paper introduces a privacy risk analysis engine based on Gaussian mixture models that combines exact and approximate inference. It extends the multivariate Gaussian engine by supporting exact inference in programs with continuous and discrete distributions as well as if-statements. Furthermore, the engine allows for approximating attacker knowledge that is not normally distributed. We evaluate the method by analyzing privacy risks in programs to release public statistics, differential privacy mechanisms, randomized response and attribute generalization. Finally, we show that our engine can be used to analyze programs involving thousands of sensitive records.<\/jats:p>","DOI":"10.1007\/s10270-025-01298-x","type":"journal-article","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T09:58:55Z","timestamp":1750672735000},"page":"989-1010","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantifying Privacy Risk with Gaussian Mixtures"],"prefix":"10.1007","volume":"25","author":[{"given":"Rasmus C.","family":"R\u00f8nneberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesca","family":"Randone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ra\u00fal","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"W\u0105sowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,23]]},"reference":[{"key":"1298_CR1","unstructured":"Article 29 Data Protection Working Party: Opinion 05\/2014 on Anonymisation Techniques (2014). http:\/\/www.pdpjournals.com\/docs\/88197.pdf Accessed 2018-02-14"},{"key":"1298_CR2","volume-title":"The Anonymisation Decision - Making Framework","author":"M Elliot","year":"2016","unstructured":"Elliot, M., Mackey, E., O\u2019Hara, K., Tudor, C.: The Anonymisation Decision - Making Framework. University of Manchester, UKAN (2016)"},{"issue":"3\u20134","key":"1298_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014). https:\/\/doi.org\/10.1561\/0400000042","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1298_CR4","doi-asserted-by":"publisher","unstructured":"Alvim, M., Chatzikokolakis, K., McIver, A., Morgan, C., Palamidessi, C., Smith, G.: The Science of Quantitative Information Flow. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-319-96131-6","DOI":"10.1007\/978-3-319-96131-6"},{"key":"1298_CR5","doi-asserted-by":"publisher","unstructured":"Chothia, T., Kawamoto, Y., Novakovic, C.: A tool for estimating information leakage. In: CAV\u201913. LNCS, vol. 8044, pp. 690\u2013695. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_47","DOI":"10.1007\/978-3-642-39799-8_47"},{"key":"1298_CR6","doi-asserted-by":"publisher","unstructured":"Chothia, T., Kawamoto, Y., Novakovic, C.: Leakwatch: Estimating information leakage from Java programs. In: ESORICS\u201914. LNCS, vol. 8713. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11212-1_13","DOI":"10.1007\/978-3-319-11212-1_13"},{"key":"1298_CR7","doi-asserted-by":"publisher","unstructured":"Biondi, F., Legay, A., Traonouez, L., Wasowski, A.: QUAIL: A quantitative security analyzer for imperative code. In: CAV\u201913, pp. 702\u2013707. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_49","DOI":"10.1007\/978-3-642-39799-8_49"},{"issue":"2","key":"1298_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00165-018-0469-z","volume":"31","author":"F Biondi","year":"2019","unstructured":"Biondi, F., Kawamoto, Y., Legay, A., Traonouez, L.: Hybrid statistical estimation of mutual information and its application to information flow. Formal Aspects Comput. 31(2), 165\u2013206 (2019). https:\/\/doi.org\/10.1007\/s00165-018-0469-z","journal-title":"Formal Aspects Comput."},{"key":"1298_CR9","doi-asserted-by":"publisher","unstructured":"Kucera, M., Tsankov, P., Gehr, T., Guarnieri, M., Vechev, M.T.: Synthesis of probabilistic privacy enforcement. In: CCS\u201917, pp. 391\u2013408. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134079","DOI":"10.1145\/3133956.3134079"},{"key":"1298_CR10","doi-asserted-by":"publisher","unstructured":"Cherubin, G., Chatzikokolakis, K., Palamidessi, C.: F-BLEAU: fast black-box leakage estimation. In: SP\u201919, pp. 835\u2013852. IEEE, New York, NY (2019). https:\/\/doi.org\/10.1109\/SP.2019.00073","DOI":"10.1109\/SP.2019.00073"},{"key":"1298_CR11","doi-asserted-by":"publisher","unstructured":"Romanelli, M., Chatzikokolakis, K., Palamidessi, C., Piantanida, P.: Estimating g-leakage via machine learning. In: CCS\u201920. ACM, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3372297.3423363","DOI":"10.1145\/3372297.3423363"},{"key":"1298_CR12","doi-asserted-by":"publisher","unstructured":"Pardo, R., Rafnsson, W., Probst, C.W., Wasowski, A.: Privug: Using probabilistic programming for quantifying leakage in privacy risk analysis. In: ESORICS\u201921. LNCS, vol. 12973. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_21","DOI":"10.1007\/978-3-030-88428-4_21"},{"key":"1298_CR13","doi-asserted-by":"publisher","unstructured":"R\u00f8nneberg, R.C., Pardo, R., Wasowski, A.: Exact and efficient bayesian inference for privacy risk quantification. In: Proceedings of the 21st International Conference Software Engineering and Formal Methods, SEFM\u201923. Lecture Notes in Computer Science, vol. 14323, pp. 263\u2013281. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47115-5_15","DOI":"10.1007\/978-3-031-47115-5_15"},{"key":"1298_CR14","doi-asserted-by":"publisher","unstructured":"Pardo, R., Rafnsson, W., Steinhorn, G., Lavrov, D., Lumley, T., Probst, C.W., Ziedins, I., Wasowski, A.: Privacy with good taste - A case study in quantifying privacy risks in genetic scores. In: Data Privacy Management, Cryptocurrencies and Blockchain Technology - ESORICS 2022 International Workshops, DPM 2022 and CBT 2022, Copenhagen, Denmark, September 26-30, 2022, Revised Selected Papers. Lecture Notes in Computer Science, vol. 13619, pp. 103\u2013119. Springer, ??? (2022). https:\/\/doi.org\/10.1007\/978-3-031-25734-6_7","DOI":"10.1007\/978-3-031-25734-6_7"},{"key":"1298_CR15","doi-asserted-by":"publisher","unstructured":"Halvorsen, L., Steffensen, S.L., Rafnsson, W., Kulyk, O., Pardo, R.: How attacker knowledge affects privacy risks: An analysis using probabilistic programming. In: IWSPA@CODASPY 2022: Proceedings of the 2022 ACM on International Workshop on Security and Privacy Analytics, Baltimore, MD, USA, April 27, 2022, pp. 55\u201365. ACM, ??? (2022). https:\/\/doi.org\/10.1145\/3510548.3519380","DOI":"10.1145\/3510548.3519380"},{"key":"1298_CR16","doi-asserted-by":"publisher","unstructured":"Robert, C.P., George Casella: Monte Carlo Statistical Methods. Springer, New York, NY (2004). https:\/\/doi.org\/10.1007\/978-1-4757-4145-2","DOI":"10.1007\/978-1-4757-4145-2"},{"key":"1298_CR17","doi-asserted-by":"publisher","unstructured":"Randone, F., Bortolussi, L., Incerto, E., Tribastone, M.: Inference of probabilistic programs with moment-matching gaussian mixtures. Proc. ACM Program. Lang. 8(POPL), 1882\u20131912 (2024) https:\/\/doi.org\/10.1145\/3632905","DOI":"10.1145\/3632905"},{"issue":"309","key":"1298_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"SL Warner","year":"1965","unstructured":"Warner, S.L.: Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Association 60(309), 63\u201369 (1965)","journal-title":"Journal of the American Statistical Association"},{"key":"1298_CR19","doi-asserted-by":"publisher","unstructured":"Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 10(5), 571\u2013588 (2002) https:\/\/doi.org\/10.1142\/S021848850200165X","DOI":"10.1142\/S021848850200165X"},{"key":"1298_CR20","doi-asserted-by":"publisher","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: FOSE\u201914, pp. 167\u2013181. ACM, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2593882.2593900","DOI":"10.1145\/2593882.2593900"},{"key":"1298_CR21","doi-asserted-by":"publisher","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience, USA (2006). https:\/\/doi.org\/10.1002\/047174882X","DOI":"10.1002\/047174882X"},{"key":"1298_CR22","doi-asserted-by":"publisher","unstructured":"Eaton, M.L.: Multivariate Statistics: A Vector Space Approach. Lecture notes-monograph series. Institute of Mathematical Statistics, . (2007). https:\/\/doi.org\/10.1177\/002224378402100214","DOI":"10.1177\/002224378402100214"},{"key":"1298_CR23","doi-asserted-by":"publisher","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models - Principles and Techniques. MIT Press, Cambridge MA (2009). https:\/\/doi.org\/10.5555\/1795555","DOI":"10.5555\/1795555"},{"key":"1298_CR24","doi-asserted-by":"publisher","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Information science and statistics. Springer, New York (2006). https:\/\/doi.org\/10.5555\/1162264","DOI":"10.5555\/1162264"},{"issue":"5","key":"1298_CR25","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TIT.1972.1054885","volume":"18","author":"J Lo","year":"1972","unstructured":"Lo, J.: Finite-dimensional sensor orbits and optimal nonlinear filtering. IEEE Transactions on information theory 18(5), 583\u2013588 (1972). https:\/\/doi.org\/10.1109\/TIT.1972.1054885","journal-title":"IEEE Transactions on information theory"},{"key":"1298_CR26","doi-asserted-by":"publisher","unstructured":"Billingsley, P.: Convergence of Probability Measures. John Wiley & Sons, New York (2013). https:\/\/doi.org\/10.1002\/9780470316962","DOI":"10.1002\/9780470316962"},{"key":"1298_CR27","doi-asserted-by":"publisher","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: Proceedings of the on Future of Software Engineering, FOSE 2014, Hyderabad, India, May 31 - June 7, 2014, pp. 167\u2013181. ACM, ??? (2014). https:\/\/doi.org\/10.1145\/2593882.2593900","DOI":"10.1145\/2593882.2593900"},{"issue":"5","key":"1298_CR28","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10(5), 557\u2013570 (2002). https:\/\/doi.org\/10.1142\/S0218488502001648","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-based Systems"},{"issue":"4","key":"1298_CR29","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2139\/ssrn.2748900","volume":"26","author":"R Kan","year":"2017","unstructured":"Kan, R., Robotti, C.: On moments of folded and truncated multivariate normal distributions. Journal of Computational and Graphical Statistics 26(4), 930\u2013934 (2017). https:\/\/doi.org\/10.2139\/ssrn.2748900","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"1298_CR30","unstructured":"Parr, T.: The Definitive ANTLR 4 Reference. Pragmatic Bookshelf (2013)"},{"key":"1298_CR31","unstructured":"Statistics Denmark. https:\/\/www.dst.dk\/en. Accessed: 2023-06-23"},{"key":"1298_CR32","unstructured":"Statistics New Zealand. https:\/\/www.stats.govt.nz\/. Accessed: 2023-06-23"},{"key":"1298_CR33","unstructured":"US Census Bureau. https:\/\/www.census.gov\/. Accessed: 2023-06-23"},{"issue":"3","key":"1298_CR34","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/3287287","volume":"62","author":"SL Garfinkel","year":"2019","unstructured":"Garfinkel, S.L., Abowd, J.M., Martindale, C.: Understanding database reconstruction attacks on public data. Commun. ACM 62(3), 46\u201353 (2019). https:\/\/doi.org\/10.1145\/3287287","journal-title":"Commun. ACM"},{"key":"1298_CR35","doi-asserted-by":"publisher","unstructured":"Dwork, C., Kohli, N., Mulligan, D.: Differential privacy in practice: Expose your epsilons! Journal of Privacy and Confidentiality 9(2) (2019) https:\/\/doi.org\/10.29012\/jpc.689","DOI":"10.29012\/jpc.689"},{"key":"1298_CR36","doi-asserted-by":"publisher","unstructured":"Salvatier, J., Wiecki, T.V., Fonnesbeck, C.: Probabilistic programming in python using pymc3. PeerJ Computer Science 2, 55 (2016) https:\/\/doi.org\/10.48550\/arXiv.1507.08050","DOI":"10.48550\/arXiv.1507.08050"},{"key":"1298_CR37","doi-asserted-by":"publisher","unstructured":"R\u00f8nneberg, R.C., Pardo, R., W\u0105sowski, A.: Exact and efficient bayesian inference for privacy risk quantification. In: Software Engineering and Formal Methods, pp. 263\u2013281. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47115-5_15","DOI":"10.1007\/978-3-031-47115-5_15"},{"key":"1298_CR38","doi-asserted-by":"publisher","unstructured":"Gehr, T., Steffen, S., Vechev, M.: $$\\lambda $$PSI: exact inference for higher-order probabilistic programs. In: PLDI\u201920, pp. 883\u2013897. ACM, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3385412.3386006","DOI":"10.1145\/3385412.3386006"},{"key":"1298_CR39","doi-asserted-by":"publisher","unstructured":"Chothia, T., Guha, A.: A statistical test for information leaks using continuous mutual information. In: CSF\u201911, pp. 177\u2013190. IEEE, New York, NY (2011). https:\/\/doi.org\/10.1109\/CSF.2011.19","DOI":"10.1109\/CSF.2011.19"},{"key":"1298_CR40","doi-asserted-by":"publisher","unstructured":"Avi Pfeffer: Practical Probabilistic Programming. Manning Publications Co., New York, NY (2016). https:\/\/doi.org\/10.5555\/3033232","DOI":"10.5555\/3033232"},{"key":"1298_CR41","doi-asserted-by":"publisher","unstructured":"Chib, S., Greenberg, E.: Understanding the Metropolis-Hastings Algorithm, 10 https:\/\/doi.org\/10.2307\/2684568","DOI":"10.2307\/2684568"},{"issue":"1","key":"1298_CR42","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.5555\/2627435.2638586","volume":"15","author":"MD Homan","year":"2014","unstructured":"Homan, M.D., Gelman, A.: The no-u-turn sampler: Adaptively setting path lengths in hamiltonian monte carlo. J. Mach. Learn. Res. 15(1), 1593\u20131623 (2014). https:\/\/doi.org\/10.5555\/2627435.2638586","journal-title":"J. Mach. Learn. Res."},{"key":"1298_CR43","doi-asserted-by":"publisher","unstructured":"Gehr, T., Misailovic, S., Vechev, M.T.: PSI: exact symbolic inference for probabilistic programs. In: CAV\u201916. LNCS, vol. 9779, pp. 62\u201383. Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_4","DOI":"10.1007\/978-3-319-41528-4_4"},{"key":"1298_CR44","doi-asserted-by":"publisher","unstructured":"Narayanan, P., Carette, J., Romano, W., Shan, C., Zinkov, R.: Probabilistic inference by program transformation in hakaru (system description). In: FLOPS\u201916. LNCS, vol. 9613, pp. 62\u201379. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29604-3_5","DOI":"10.1007\/978-3-319-29604-3_5"},{"key":"1298_CR45","doi-asserted-by":"publisher","unstructured":"Saad, F.A., Rinard, M.C., Mansinghka, V.K.: SPPL: Probabilistic programming with fast exact symbolic inference. In: PLDI\u201921, pp. 804\u2013819. ACM, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3453483.3454078","DOI":"10.1145\/3453483.3454078"},{"key":"1298_CR46","doi-asserted-by":"publisher","unstructured":"Stein, D., Staton, S.: Compositional semantics for probabilistic programs with exact conditioning. In: LICS\u201921, pp. 1\u201313. IEEE, New York, NY (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470552","DOI":"10.1109\/LICS52264.2021.9470552"}],"container-title":["Software and Systems Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-025-01298-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10270-025-01298-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-025-01298-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,31]],"date-time":"2026-08-31T03:25:44Z","timestamp":1788146744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10270-025-01298-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,23]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["1298"],"URL":"https:\/\/doi.org\/10.1007\/s10270-025-01298-x","relation":{},"ISSN":["1619-1366","1619-1374"],"issn-type":[{"value":"1619-1366","type":"print"},{"value":"1619-1374","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,23]]},"assertion":[{"value":"10 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}