{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:59:26Z","timestamp":1773511166849,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642392115","type":"print"},{"value":"9783642392122","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_8","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"49-60","source":"Crossref","is-referenced-by-count":38,"title":["Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Barthe","sequence":"first","affiliation":[]},{"given":"Federico","family":"Olmedo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abate, A.: Approximation metrics based on probabilistic bisimulations for general state-space markov processes: a survey. Electronic Notes in Theoretical Computer Sciences (2012) (in print)","DOI":"10.1016\/j.entcs.2013.12.002"},{"issue":"1","key":"8_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.2517-6161.1966.tb00626.x","volume":"28","author":"S.M. Ali","year":"1966","unstructured":"Ali, S.M., Silvey, S.D.: A general class of coefficients of divergence of one distribution from another. Journal of the Royal Statistical Society. Series B (Methodological)\u00a028(1), 131\u2013142 (1966)","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-22012-8_4","volume-title":"Automata, Languages and Programming","author":"M.S. Alvim","year":"2011","unstructured":"Alvim, M.S., Andr\u00e9s, M.E., Chatzikokolakis, K., Palamidessi, C.: On the relation between differential privacy and Quantitative Information Flow. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 60\u201376. Springer, Heidelberg (2011)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G. Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., B\u00e9guelin, S.Z.: Computer-aided security proofs for the working cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 71\u201390. Springer, Heidelberg (2011)"},{"key":"8_CR5","first-page":"90","volume-title":"36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009","author":"G. Barthe","year":"2009","unstructured":"Barthe, G., Gr\u00e9goire, B., Zanella-B\u00e9guelin, S.: Formal certification of code-based cryptographic proofs. In: 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, pp. 90\u2013101. ACM, New York (2009)"},{"key":"8_CR6","first-page":"97","volume-title":"39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012","author":"G. Barthe","year":"2012","unstructured":"Barthe, G., K\u00f6pf, B., Olmedo, F., Zanella-B\u00e9guelin, S.: Probabilistic relational reasoning for differential privacy. In: 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, pp. 97\u2013110. ACM, New York (2012)"},{"key":"8_CR7","first-page":"102","volume-title":"19th ACM SIGSOFT Symposium on the Foundations of Software Engineering and 13rd European Software Engineering Conference, ESEC\/FSE 2011","author":"S. Chaudhuri","year":"2011","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R., Navidpour, S.: Proving programs robust. In: 19th ACM SIGSOFT Symposium on the Foundations of Software Engineering and 13rd European Software Engineering Conference, ESEC\/FSE 2011, pp. 102\u2013112. ACM, New York (2011)"},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1142\/S0129054107004966","volume":"18","author":"C. Cortes","year":"2007","unstructured":"Cortes, C., Mohri, M., Rastogi, A.: Lp distance and equivalence of probabilistic automata. Int. J. Found. Comput. Sci.\u00a018(4), 761\u2013779 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1142\/S0129054108005644","volume":"19","author":"C. Cortes","year":"2008","unstructured":"Cortes, C., Mohri, M., Rastogi, A., Riley, M.: On the computation of the relative entropy of probabilistic automata. Int. J. Found. Comput. Sci.\u00a019(1), 219\u2013242 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR10","first-page":"85","volume":"8","author":"I. Csisz\u00e1r","year":"1963","unstructured":"Csisz\u00e1r, I.: Eine informationstheoretische ungleichung und ihre anwendung auf den beweis der ergodizitat von markoffschen ketten. Publications of the Mathematical Institute of the Hungarian Academy of Science\u00a08, 85\u2013108 (1963)","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Science"},{"key":"8_CR11","unstructured":"Deng, Y., Du, W.: Logical, metric, and algorithmic characterisations of probabilistic bisimulation. Tech. Rep. CMU-CS-11-110, Carnegie Mellon University (March 2011)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C. Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Ebanks, B., Sahoo, P., Sander, W.: Characterizations of Information Measures. World Scientific (1998)","DOI":"10.1142\/3354"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1145\/2429069.2429113","volume-title":"40th ACM SIGPLAN\u2013SIGACT Symposium on Principles of Programming Languages, POPL 2013","author":"M. Gaboardi","year":"2013","unstructured":"Gaboardi, M., Haeberlen, A., Hsu, J., Narayan, A., Pierce, B.C.: Linear dependent types for differential privacy. In: 40th ACM SIGPLAN\u2013SIGACT Symposium on Principles of Programming Languages, POPL 2013, pp. 357\u2013370. ACM, New York (2013)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/B978-044482830-9\/50029-1","volume-title":"Handbook of Process Algebra","author":"B. Jonsson","year":"2001","unstructured":"Jonsson, B., Yi, W., Larsen, K.G.: Probabilistic extensions of process algebras. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 685\u2013710. Elsevier, Amsterdam (2001)"},{"issue":"9","key":"8_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1810891.1810916","volume":"53","author":"F. McSherry","year":"2010","unstructured":"McSherry, F.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. Commun. ACM\u00a053(9), 89\u201397 (2010)","journal-title":"Commun. ACM"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1559845.1559850","volume-title":"35th SIGMOD International Conference on Management of Data, SIGMOD 2009","author":"F.D. McSherry","year":"2009","unstructured":"McSherry, F.D.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In: 35th SIGMOD International Conference on Management of Data, SIGMOD 2009, pp. 19\u201330. ACM, New York (2009)"},{"issue":"4","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/18.605597","volume":"43","author":"M. Pardo","year":"1997","unstructured":"Pardo, M., Vajda, I.: About distances of discrete distributions satisfying the data processing theorem of information theory. IEEE Transactions on Information Theory\u00a043(4), 1288\u20131293 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR19","unstructured":"Pierce, B.C.: Differential privacy in the programming languages community. Invited Tutorial at DIMACS Workshop on Recent Work on Differential Privacy Across Computer Science (2012)"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.03.002","volume":"340","author":"A. Pierro Di","year":"2005","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Measuring the confinement of probabilistic systems. Theor. Comput. Sci.\u00a0340(1), 3\u201356 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/1863543.1863568","volume-title":"15th ACM SIGPLAN International Conference on Functional programming, ICFP 2010","author":"J. Reed","year":"2010","unstructured":"Reed, J., Pierce, B.C.: Distance makes the types grow stronger: a calculus for differential privacy. In: 15th ACM SIGPLAN International Conference on Functional programming, ICFP 2010, pp. 157\u2013168. ACM, New York (2010)"},{"key":"8_CR22","first-page":"297","volume-title":"7th USENIX Conference on Networked Systems Design and Implementation, NSDI 2010","author":"I. Roy","year":"2010","unstructured":"Roy, I., Setty, S.T.V., Kilzer, A., Shmatikov, V., Witchel, E.: Airavat: security and privacy for MapReduce. In: 7th USENIX Conference on Networked Systems Design and Implementation, NSDI 2010, pp. 297\u2013312. USENIX Association, Berkeley (2010)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Segala, R., Turrini, A.: Approximated computationally bounded simulation relations for probabilistic automata. In: 20th IEEE Computer Security Foundations Symposium, CSF 2007, pp. 140\u2013156. IEEE Computer Society (2007)","DOI":"10.1109\/CSF.2007.8"},{"key":"8_CR24","unstructured":"Steinberger, J.: Improved security bounds for key-alternating ciphers via hellinger distance. Cryptology ePrint Archive, Report 2012\/481 (2012), http:\/\/eprint.iacr.org\/"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Tracol, M., Desharnais, J., Zhioua, A.: Computing distances between probabilistic automata. In: Proceedings of QAPL. EPTCS, vol.\u00a057, pp. 148\u2013162 (2011)","DOI":"10.4204\/EPTCS.57.11"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T01:16:24Z","timestamp":1645924584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}