{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T11:10:07Z","timestamp":1746357007889,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319106953"},{"type":"electronic","value":"9783319106960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10696-0_28","type":"book-chapter","created":{"date-parts":[[2014,8,27]],"date-time":"2014-08-27T14:33:45Z","timestamp":1409150025000},"page":"368-383","source":"Crossref","is-referenced-by-count":8,"title":["Compositionality Results for Quantitative Information Flow"],"prefix":"10.1007","author":[{"given":"Yusuke","family":"Kawamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"leakiEst, http:\/\/www.cs.bham.ac.uk\/research\/projects\/infotools\/leakiest\/"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., Palamidessi, C., Smith, G.: Measuring information leakage using generalized gain functions. In: Proc. of CSF, pp. 265\u2013279. IEEE (2012)","DOI":"10.1109\/CSF.2012.26"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-12002-2_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M.E. Andr\u00e9s","year":"2010","unstructured":"Andr\u00e9s, M.E., Palamidessi, C., van Rossum, P., Smith, G.: Computing the leakage of information-hiding systems. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 373\u2013389. Springer, Heidelberg (2010)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Barthe, G., K\u00f6pf, B.: Information-theoretic bounds for differentially private mechanisms. In: Proc. of CSF, pp. 191\u2013204. IEEE (2011)","DOI":"10.1109\/CSF.2011.20"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11787006_11","volume-title":"Automata, Languages and Programming","author":"M. Boreale","year":"2006","unstructured":"Boreale, M.: Quantifying information leakage in process calculi. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 119\u2013131. Springer, Heidelberg (2006)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-642-19805-2_27","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Boreale","year":"2011","unstructured":"Boreale, M., Pampaloni, F., Paolini, M.: Asymptotic information leakage under one-try attacks. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 396\u2013410. Springer, Heidelberg (2011)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Braun, C., Chatzikokolakis, K., Palamidessi, C.: Quantitative notions of leakage for one-try attacks. In: Proc. of MFPS. ENTCS, vol.\u00a0249, pp. 75\u201391. Elsevier (2009)","DOI":"10.1016\/j.entcs.2009.07.085"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-69053-0_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"C. Cachin","year":"1997","unstructured":"Cachin, C.: Smooth entropy and r\u00e9nyi entropy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 193\u2013208. Springer, Heidelberg (1997)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-12002-2_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Chatzikokolakis","year":"2010","unstructured":"Chatzikokolakis, K., Chothia, T., Guha, A.: Statistical Measurement of Information Leakage. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 390\u2013404. Springer, Heidelberg (2010)"},{"issue":"2-4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.ic.2007.07.003","volume":"206","author":"K. Chatzikokolakis","year":"2008","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Inf. and Comp.\u00a0206(2-4), 378\u2013401 (2008)","journal-title":"Inf. and Comp."},{"issue":"5","key":"28_CR11","doi-asserted-by":"crossref","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. of Comp. Security\u00a016(5), 531\u2013571 (2008)","journal-title":"J. of Comp. Security"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Chothia, T., Kawamoto, Y., Novakovic, C., Parker, D.: Probabilistic point-to-point information leakage. In: Proc. of CSF, pp. 193\u2013205. IEEE (June 2013)","DOI":"10.1109\/CSF.2013.20"},{"key":"28_CR13","unstructured":"Chothia, T., Kawamoto, Y.: Statistical estimation of min-entropy leakage (April 2014), http:\/\/www.cs.bham.ac.uk\/research\/projects\/infotools\/ (manuscript)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-642-39799-8_47","volume-title":"Computer Aided Verification","author":"T. Chothia","year":"2013","unstructured":"Chothia, T., Kawamoto, Y., Novakovic, C.: A tool for estimating information leakage. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 690\u2013695. Springer, Heidelberg (2013)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantitative analysis of the leakage of confidential data. In: Proc. of QAPL. ENTCS, vol.\u00a059(3), pp. 238\u2013251. Elsevier (2001)","DOI":"10.1016\/S1571-0661(04)00290-7"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Espinoza, B., Smith, G.: Min-entropy as a resource. Information and Computation (2013)","DOI":"10.1016\/j.ic.2013.03.005"},{"key":"28_CR17","unstructured":"Kawamoto, Y., Chatzikokolakis, K., Palamidessi, C.: Compositionality Results for Quantitative Information Flow. Tech. rep., INRIA (2014), http:\/\/hal.inria.fr\/hal-00999723"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., Basin, D.A.: An information-theoretic model for adaptive side-channel attacks. In: Proc. of CCS, pp. 286\u2013296. ACM (2007)","DOI":"10.1145\/1315245.1315282"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 2.0: A tool for probabilistic model checking. In: Proc. of QEST, pp. 322\u2013323. IEEE (2004)","DOI":"10.1109\/QEST.2004.1348048"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Malacaria, P.: Assessing security threats of looping constructs. In: Proc. of POPL, pp. 225\u2013235. ACM (2007)","DOI":"10.1145\/1190215.1190251"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Nassu, B., Nanya, T., Duarte, E.: Topology discovery in dynamic and decentralized networks with mobile agents and swarm intelligence. In: Proc. of ISDA, pp. 685\u2013690. IEEE (2007)","DOI":"10.1109\/ISDA.2007.13"},{"issue":"1","key":"28_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M.K. Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: anonymity for Web transactions. ACM Trans. on Information and System Security\u00a01(1), 66\u201392 (1998)","journal-title":"ACM Trans. on Information and System Security"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-15375-4_5","volume-title":"CONCUR 2010 - Concurrency Theory","author":"V. Sassone","year":"2010","unstructured":"Sassone, V., Hamadou, S., Yang, M.: Trust in anonymity networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 48\u201370. Springer, Heidelberg (2010)"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Shmatikov, V.: Probabilistic analysis of anonymity. In: Proc. of CSFW, pp. 119\u2013128. IEEE (2002)","DOI":"10.1109\/CSFW.2002.1021811"},{"key":"28_CR25","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.\u00a05504, pp. 288\u2013302. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10696-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T10:54:48Z","timestamp":1746356088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10696-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319106953","9783319106960"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10696-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}