{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:29:44Z","timestamp":1770751784303,"version":"3.50.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030311742","type":"print"},{"value":"9783030311759","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31175-9_19","type":"book-chapter","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T10:18:17Z","timestamp":1572949097000},"page":"329-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Categorical Information Flow"],"prefix":"10.1007","author":[{"given":"Tahiry","family":"Rabehaja","sequence":"first","affiliation":[]},{"given":"Annabelle","family":"McIver","sequence":"additional","affiliation":[]},{"given":"Carroll","family":"Morgan","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,4]]},"reference":[{"key":"19_CR1","volume-title":"Abstract and Concrete Categories","author":"J Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. Wiley, New York (1990)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Alvim, M., Andr\u00e9s, M., Palamidessi, C.: Probabilistic information flow. In Proceedings of the 25th IEEE Symposium on Logic in Computer Science, pp. 314\u2013321 (2010)","DOI":"10.1109\/LICS.2010.53"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Alvim, M., Chatzikokolakis, K., McIver, A., Morgan, C., Palamidessi, C., Smith, G.: Additive and multiplicative notions of leakage, and their capacities. In: Proceedings of the IEEE 27th Computer Security Foundations Symposium, pp. 308\u2013322 (2014)","DOI":"10.1109\/CSF.2014.29"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Alvim, M., Chatzikokolakis, K., Palamidessi, C., Smith, G.: Measuring information leakage using generalized gain functions. In: Proceedings of the 25th IEEE Computer Security Foundations Symposium, pp. 265\u2013279, June 2012","DOI":"10.1109\/CSF.2012.26"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.entcs.2009.07.085","volume":"249","author":"Christelle Braun","year":"2009","unstructured":"Braun, C., Chatzikokolakis, K., Palamidessi, C.: Quantitative notions of leakage for one-try attacks. In: Proceedings of the 25th International Conference on Mathematical Foundations of Programming Semantics, pp. 75\u201391 (2009)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"19_CR6","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0092872","volume-title":"Categorical Aspects of Topology and Analysis","author":"M Giry","year":"1982","unstructured":"Giry, M.: A categorical approach to probability theory. In: Banaschewski, B. (ed.) Categorical Aspects of Topology and Analysis. LNM, vol. 915, pp. 68\u201385. Springer, Heidelberg (1982). \n                      https:\/\/doi.org\/10.1007\/BFb0092872"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-45238-6_3","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"C Karlof","year":"2003","unstructured":"Karlof, C., Wagner, D.: Hidden Markov model cryptanalysis. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 17\u201334. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-45238-6_3"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-14162-1_19","volume-title":"Automata, Languages and Programming","author":"A McIver","year":"2010","unstructured":"McIver, A., Meinicke, L., Morgan, C.: Compositional closure for Bayes risk in probabilistic noninterference. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 223\u2013235. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14162-1_19"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"McIver, A., Morgan, C., Rabehaja, T.: Abstract hidden Markov models: a monadic account of quantitative information flow. In: Proceedings of the 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 597\u2013608 (2015)","DOI":"10.1109\/LICS.2015.61"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-57418-9_1","volume-title":"Relational and Algebraic Methods in Computer Science","author":"AK McIver","year":"2017","unstructured":"McIver, A.K., Morgan, C.C., Rabehaja, T.: Algebra for quantitative information flow. In: H\u00f6fner, P., Pous, D., Struth, G. (eds.) RAMICS 2017. LNCS, vol. 10226, pp. 3\u201323. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-57418-9_1"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-60225-7_11","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"N Bordenabe","year":"2017","unstructured":"Bordenabe, N., McIver, A., Morgan, C., Rabehaja, T.: Reasoning about distributed secrets. In: Bouajjani, A., Silva, A. (eds.) FORTE 2017. LNCS, vol. 10321, pp. 156\u2013170. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-60225-7_11"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-54792-8_5","volume-title":"Principles of Security and Trust","author":"A McIver","year":"2014","unstructured":"McIver, A., Morgan, C., Smith, G., Espinoza, B., Meinicke, L.: Abstract channels and their robust information-leakage ordering. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 83\u2013102. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-642-54792-8_5"},{"key":"19_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-0022-4.50006-5","volume-title":"Probability Measures on Metric Spaces","author":"KR Parthasarathy","year":"1967","unstructured":"Parthasarathy, K.R.: Probability Measures on Metric Spaces. Academic Press, Cambridge (1967)"},{"key":"19_CR14","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-00596-1_21"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Smith, G.: Quantifying information flow using min-entropy. In: Proceedings of the 8th International Conference on Quantitative Evaluation of SysTems, pp. 159\u2013167 (2011)","DOI":"10.1109\/QEST.2011.31"},{"key":"19_CR16","unstructured":"van Breugel, F.: The metric monad for probabilistic nondeterminism (2005). Draft available at \n                      http:\/\/www.cse.yorku.ca\/~franck\/research\/drafts\/monad.pdf"}],"container-title":["Lecture Notes in Computer Science","The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31175-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T10:50:35Z","timestamp":1572951035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31175-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030311742","9783030311759"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31175-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}