{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T23:28:12Z","timestamp":1759879692339,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134079","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"391-408","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Synthesis of Probabilistic Privacy Enforcement"],"prefix":"10.1145","author":[{"given":"Martin","family":"Ku\u010dera","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Petar","family":"Tsankov","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Timon","family":"Gehr","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Marco","family":"Guarnieri","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Martin","family":"Vechev","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2017. OpenSNP - A Crowdsourced Web Resource for Personal Genomics. https: \/\/opensnp.org\/snps\/rs11200638. (2017)."},{"key":"e_1_3_2_2_2_1","unstructured":"2017. Privacy of Genomics. https:\/\/www.genome.gov\/27561246\/privacy-ingenomics\/. (2017)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978355"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the 8th International Workshop on Satisfiability Modulo Theories","volume":"13","author":"Barrett Clark","year":"2010","unstructured":"Clark Barrett, Aaron Stump, Cesare Tinelli, et al. 2010. The smt-lib standard: Version 2.0. In Proceedings of the 8th International Workshop on Satisfiability Modulo Theories (Edinburgh, England), Vol. 13. 14."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.09.001"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129513000637"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11599-3_11"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_14"},{"key":"e_1_3_2_2_9_1","unstructured":"Matt Blaze Joan Feigenbaum John Ioannidis and Angelos Keromytis. 2017. The KeyNote Trust-Management System. http:\/\/www.cs.columbia.edu\/~angelos\/ keynote.html. (2017)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2016.14"},{"key":"e_1_3_2_2_11_1","volume-title":"Fabular: Regression Formulas As Probabilistic Programming (POPL).","author":"Borgstr\u00f6m Johannes","year":"2016","unstructured":"Johannes Borgstr\u00f6m, Andrew D. Gordon, Long Ouyang, Claudio Russo, Adam Scibior, and Marcin Szymczak. 2016. Fabular: Regression Formulas As Probabilistic Programming (POPL)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-008-0058-x"},{"key":"e_1_3_2_2_13_1","volume-title":"International Symposium on Trustworthy Global Computing. Springer, 281--300","author":"Chatzikokolakis Konstantinos","year":"2006","unstructured":"Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. 2006. Anonymity protocols as noisy channels. In International Symposium on Trustworthy Global Computing. Springer, 281--300."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2009-0353"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1133807"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2008.4605918"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_20_1","first-page":"3","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth. 2014. The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science 9, 3--4 (2014), 211--407.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-014-0196-4"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--41528--4_4"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_26"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.3102\/1076998615606113"},{"key":"e_1_3_2_2_25_1","volume-title":"Church: A language for generative models. In UAI.","author":"Goodman ND","year":"2008","unstructured":"ND Goodman, VK Mansinghka, D Roy, K Bonawitz, and JB Tenenbaum. 2008. Church: A language for generative models. In UAI."},{"key":"e_1_3_2_2_26_1","volume-title":"Rajamani","author":"Gordon Andrew D.","year":"2014","unstructured":"Andrew D. Gordon, Thomas A. Henzinger, Aditya V. Nori, and Sriram K. Rajamani. 2014. Probabilistic Programming (FOSE 2014)."},{"key":"e_1_3_2_2_27_1","volume-title":"Securing Databases from Probabilistic Inference. arXiv preprint arXiv:1706.02473","author":"Guarnieri Marco","year":"2017","unstructured":"Marco Guarnieri, Srdjan Marinovic, and David Basin. 2017. Securing Databases from Probabilistic Inference. arXiv preprint arXiv:1706.02473 (2017)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2014.7005032"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11760146_14"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.1000167"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2015.06.490"},{"volume-title":"Complexity of computer computations","author":"Karp Richard M","key":"e_1_3_2_2_33_1","unstructured":"Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85--103."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-008-0212-5"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526899"},{"key":"e_1_3_2_2_36_1","volume-title":"Venture: a higherorder probabilistic programming platform with programmable inference. ArXiv 1404.0099","author":"Mansinghka Vikash","year":"2014","unstructured":"Vikash Mansinghka, Daniel Selsam, and Yura Perov. 2014. Venture: a higherorder probabilistic programming platform with programmable inference. ArXiv 1404.0099 (2014)."},{"key":"e_1_3_2_2_37_1","first-page":"4","article-title":"Dynamic Enforcement of Knowledge-based Security Policies Using Probabilistic Abstract Interpretation","volume":"21","author":"Mardziel Piotr","year":"2013","unstructured":"Piotr Mardziel, Stephen Magill, Michael Hicks, and Mudhakar Srivatsa. 2013. Dynamic Enforcement of Knowledge-based Security Policies Using Probabilistic Abstract Interpretation. J. Comput. Secur. 21, 4 (July 2013), 463--532. http:\/\/dl. acm.org\/citation.cfm?id=2590624.2590625","journal-title":"J. Comput. Secur."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Aditya V Nori Chung-Kil Hur Sriram K Rajamani and Selva Samuel. 2014. R2: An efficient MCMC sampler for probabilistic programs. In AAAI.","DOI":"10.1609\/aaai.v28i1.9060"},{"key":"e_1_3_2_2_39_1","first-page":"1","article-title":"Quantifying Interdependent Privacy Risks with Location Data","volume":"99","author":"Olteanu A. M.","year":"2016","unstructured":"A. M. Olteanu, K. Huguenin, R. Shokri, M. Humbert, and J. P. Hubaux. 2016. Quantifying Interdependent Privacy Risks with Location Data. IEEE Transactions on Mobile Computing PP, 99, 1--1.","journal-title":"IEEE Transactions on Mobile Computing PP"},{"key":"e_1_3_2_2_40_1","volume-title":"Figaro: An object-oriented probabilistic programming language. Technical Report. Charles River Analytics.","author":"Pfeffer A.","year":"2009","unstructured":"A. Pfeffer. 2009. Figaro: An object-oriented probabilistic programming language. Technical Report. Charles River Analytics."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1167\/iovs.09--5114"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2000.856937"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2007.4434515"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2279914"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-008-0062--7"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2015.41"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/3266641.3266673"},{"key":"e_1_3_2_2_49_1","first-page":"3056126","article-title":"CoverUp: Privacy Through \"Forced","volume":"1145","author":"Sommer David","year":"2017","unstructured":"David Sommer, Aritra Dhar, Luka Malisa, Esfandiar Mohammadi, Daniel Ronzani, and Srdjan Capkun. 2017. CoverUp: Privacy Through \"Forced\" Participation in Anonymous Communication Networks. In ASIA CCS. ACM. https:\/\/doi.org\/10. 1145\/3052973.3056126","journal-title":"Participation in Anonymous Communication Networks. In ASIA CCS. ACM. https:\/\/doi.org\/10."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021848850200165X"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2031331.2031334"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2016.38"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54792-8_14"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304--3975(79)"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-1999-72-305"},{"key":"e_1_3_2_2_56_1","volume-title":"Jan Willem van de Meent, and Vikash Mansinghka","author":"Wood Frank","year":"2014","unstructured":"Frank Wood, Jan Willem van de Meent, and Vikash Mansinghka. 2014. A New Approach to Probabilistic Programming Inference. In AISTATS."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2014.02.038"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526781"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134079","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":56,"alternative-id":["10.1145\/3133956.3134079","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134079","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}