{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T23:28:27Z","timestamp":1759879707615},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319897219"},{"type":"electronic","value":"9783319897226"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89722-6_1","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T10:53:50Z","timestamp":1523616830000},"page":"3-27","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["What\u2019s the Over\/Under? Probabilistic Bounds on Information Leakage"],"prefix":"10.1007","author":[{"given":"Ian","family":"Sweet","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Manuel Calder\u00f3n","family":"Trilla","sequence":"additional","affiliation":[]},{"given":"Chad","family":"Scherrer","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Hicks","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Magill","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., Palamidessi, C., Smith, G.: Measuring information leakage using generalized gain functions. In: Proceedings of the IEEE Computer Security Foundations Symposium (CSF) (2012)","DOI":"10.1109\/CSF.2012.26"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Backes, M., K\u00f6pf, B., Rybalchenko, A.: Automatic discovery and quantification of information leaks. In: Proceedings of the IEEE Symposium on Security and Privacy (S&P) (2009)","DOI":"10.1109\/SP.2009.18"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10009-005-0215-8","volume":"8","author":"R Bagnara","year":"2006","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. Int. J. Softw. Tools Tech. Transf. 8(4), 449\u2013466 (2006)","journal-title":"Int. J. Softw. Tools Tech. Transf."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma polyhedra library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72, 3\u201321 (2008)","journal-title":"Sci. Comput. Program."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11547662_4","volume-title":"Static Analysis","author":"R Bagnara","year":"2005","unstructured":"Bagnara, R., Rodr\u00edguez-Carbonell, E., Zaffanella, E.: Generation of basic semi-algebraic invariants using convex polyhedra. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 19\u201334. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11547662_4"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-11599-3_11","volume-title":"Secure IT Systems","author":"F Besson","year":"2014","unstructured":"Besson, F., Bielova, N., Jensen, T.: Browser randomisation against fingerprinting: a quantitative information flow approach. In: Bernsmed, K., Fischer-H\u00fcbner, S. (eds.) NordSec 2014. LNCS, vol. 8788, pp. 181\u2013196. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11599-3_11"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-19718-5_5","volume-title":"Programming Languages and Systems","author":"J Borgstr\u00f6m","year":"2011","unstructured":"Borgstr\u00f6m, J., Gordon, A.D., Greenberg, M., Margetson, J., Van Gael, J.: Measure transformer semantics for Bayesian machine learning. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 77\u201396. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19718-5_5"},{"issue":"5","key":"1_CR8","doi-asserted-by":"publisher","first-page":"531","DOI":"10.3233\/JCS-2008-0333","volume":"16","author":"K Chatzikokolakis","year":"2008","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: On the Bayes risk in information-hiding protocols. J. Comput. Secur. 16(5), 531\u2013571 (2008)","journal-title":"J. Comput. Secur."},{"key":"1_CR9","unstructured":"Claret, G., Rajamani, S.K., Nori, A.V., Gordon, A.D., Borgstroem, J.: Bayesian inference for probabilistic programs via symbolic execution. Technical report MSR-TR-2012-86. Microsoft Research (2012)"},{"issue":"5","key":"1_CR10","doi-asserted-by":"publisher","first-page":"655","DOI":"10.3233\/JCS-2009-0353","volume":"17","author":"MR Clarkson","year":"2009","unstructured":"Clarkson, M.R., Myers, A.C., Schneider, F.B.: Quantifying information flow with beliefs. J. Comput. Secur. 17(5), 655\u2013701 (2009)","journal-title":"J. Comput. Secur."},{"key":"1_CR11","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proceedings of the Second International Symposium on Programming (1976)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the ACM SIGPLAN Conference on Principles of Programming Languages (POPL) (1977)","DOI":"10.1145\/512950.512973"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL (1978)","DOI":"10.1145\/512760.512770"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-28869-2_9","volume-title":"Programming Languages and Systems","author":"P Cousot","year":"2012","unstructured":"Cousot, P., Monerau, M.: Probabilistic abstract interpretation. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 169\u2013193. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28869-2_9"},{"key":"1_CR15","unstructured":"De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., Tauzer, J., Yoshida, R.: LattE (2008). https:\/\/www.math.ucdavis.edu\/~latte\/"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-41528-4_4","volume-title":"Computer Aided Verification","author":"T Gehr","year":"2016","unstructured":"Gehr, T., Misailovic, S., Vechev, M.: PSI: exact symbolic inference for probabilistic programs. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 62\u201383. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_4"},{"key":"1_CR17","unstructured":"Goodman, N.D., Mansinghka, V.K., Roy, D.M., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI) (2008)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: Conference on the Future of Software Engineering, FOSE 2014, pp. 167\u2013181. ACM, New York (2014)","DOI":"10.1145\/2593882.2593900"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Guarnieri, M., Marinovic, S., Basin, D.: Securing databases from probabilistic inference. In: Proceedings of IEEE Computer Security Foundations Symposium (CSF) (2017)","DOI":"10.1109\/CSF.2017.30"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.tcs.2014.04.022","volume":"538","author":"V Klebanov","year":"2014","unstructured":"Klebanov, V.: Precise quantitative information flow analysis\u2014a symbolic approach. Theor. Comput. Sci. 538, 124\u2013139 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., Basin, D.: An information-theoretic model for adaptive side-channel attacks. In: Proceedings of the ACM Conference on Computer and Communications Security (CCS) (2007)","DOI":"10.1145\/1315245.1315282"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., Rybalchenko, A.: Approximation and randomization for quantitative information-flow analysis. In: Proceedings of the IEEE Computer Security Foundations Symposium (CSF) (2010)","DOI":"10.1109\/CSF.2010.8"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38874-3_1","volume-title":"Formal Methods for Dynamical Systems","author":"B K\u00f6pf","year":"2013","unstructured":"K\u00f6pf, B., Rybalchenko, A.: Automation of quantitative information-flow analysis. In: Bernardo, M., de Vink, E., Di Pierro, A., Wiklicky, H. (eds.) SFM 2013. LNCS, vol. 7938, pp. 1\u201328. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38874-3_1"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ku\u010dera, M., Tsankov, P., Gehr, T., Guarnieri, M., Vechev, M.: Synthesis of probabilistic privacy enforcement. In: Proceedings of the ACM Conference on Computer and Communications Security (CCS) (2017)","DOI":"10.1145\/3133956.3134079"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"463","DOI":"10.3233\/JCS-130469","volume":"21","author":"P Mardziel","year":"2013","unstructured":"Mardziel, P., Magill, S., Hicks, M., Srivatsa, M.: Dynamic enforcement of knowledge-based security policies using probabilistic abstract interpretation. J. Comput. Secur. 21, 463\u2013532 (2013)","journal-title":"J. Comput. Secur."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Massey, J.L.: Guessing and entropy. In: Proceedings of IEEE International Symposium on Information Theory (ISIT) (1994)","DOI":"10.1109\/ISIT.1994.394764"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"McCamant, S., Ernst, M.D.: Quantitative information flow as network flow capacity. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (2008)","DOI":"10.1145\/1375581.1375606"},{"key":"1_CR28","unstructured":"Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D.L., Kolobov, A.: Blog: probabilistic models with unknown objects. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) (2005)"},{"key":"1_CR29","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: Proceedings of the Working Conference on Reverse Engineering (WCRE) (2001)"},{"key":"1_CR30","unstructured":"Minka, T., Winn, J., Guiver, J., Webster, S., Zaykov, Y., Yangel, B., Spengler, A., Bronskill, J.: Infer.NET 2.6. Microsoft Research, Cambridge (2014). http:\/\/research.microsoft.com\/infernet"},{"key":"1_CR31","unstructured":"Monniaux, D.: Analyse de programmes probabilistes par interpr\u00e9tation abstraite. Th\u00e9se de doctorat, Universit\u00e9 Paris IX Dauphine (2001)"},{"issue":"3","key":"1_CR32","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.entcs.2009.10.009","volume":"253","author":"C Mu","year":"2009","unstructured":"Mu, C., Clark, D.: An interval-based abstraction for quantifying information flow. Electron. Notes Theor. Comput. Sci. 253(3), 119\u2013141 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-29604-3_5","volume-title":"Functional and Logic Programming","author":"P Narayanan","year":"2016","unstructured":"Narayanan, P., Carette, J., Romano, W., Shan, C., Zinkov, R.: Probabilistic inference by program transformation in Hakaru (system description). In: Kiselyov, O., King, A. (eds.) FLOPS 2016. LNCS, vol. 9613, pp. 62\u201379. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29604-3_5"},{"issue":"1","key":"1_CR34","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1452044.1452048","volume":"31","author":"S Park","year":"2008","unstructured":"Park, S., Pfenning, F., Thrun, S.: A probabilistic language based on sampling functions. ACM Trans. Program. Lang. Syst. (TOPLAS) 31(1), 4:1\u20134:46 (2008)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"1_CR35","unstructured":"Pfeffer, A.: Figaro: an object-oriented probabilistic programming language. Technical report. Charles River Analytics (2000)"},{"key":"1_CR36","volume-title":"Statistical Relational Learning","author":"A Pfeffer","year":"2007","unstructured":"Pfeffer, A.: The design and implementation of IBAL: a general-purpose probabilistic language. In: Getoor, L., Taskar, B. (eds.) Statistical Relational Learning. MIT Press, Cambridge (2007)"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Radul, A.: Report on the probabilistic language scheme. In: Proceedings of the Dynamic Languages Symposium (DLS) (2007)","DOI":"10.1145\/1297081.1297085"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Chakarov, A., Gulwani, S.: Static analysis for probabilistic programs: inferring whole program properties from finitely many paths. In: Conference on Programming Language Design and Implementation, PLDI (2013)","DOI":"10.1145\/2491956.2462179"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Sen, K., Marinov, D., Agha, G.: CUTE: a concolic unit testing engine for C. In: ESEC\/FSE (2005)","DOI":"10.1145\/1081706.1081750"},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C Shannon","year":"1948","unstructured":"Shannon, C.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-00596-1_21","volume-title":"Foundations of Software Science and Computational Structures","author":"G Smith","year":"2009","unstructured":"Smith, G.: On the foundations of quantitative information flow. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 288\u2013302. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_21"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.entcs.2008.11.018","volume":"220","author":"MJA Smith","year":"2008","unstructured":"Smith, M.J.A.: Probabilistic abstract interpretation of imperative programs using truncated normal distributions. Electron. Notes Theor. Comput. Sci. 220, 43\u201359 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1_CR43","unstructured":"Sweet, I., Trilla, J.M.C., Scherrer, C., Hicks, M., Magill, S.: What\u2019s the over\/under? probabilistic bounds on information leakage. CoRR abs\/1802.08234, February 2018. https:\/\/arxiv.org\/abs\/1802.08234"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89722-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T14:55:14Z","timestamp":1604156114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89722-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319897219","9783319897226"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89722-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}