{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T03:12:17Z","timestamp":1770433937393,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141614","type":"print"},{"value":"9783642141621","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_19","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:21Z","timestamp":1278321981000},"page":"223-235","source":"Crossref","is-referenced-by-count":34,"title":["Compositional Closure for Bayes Risk in Probabilistic Noninterference"],"prefix":"10.1007","author":[{"given":"Annabelle","family":"McIver","sequence":"first","affiliation":[]},{"given":"Larissa","family":"Meinicke","sequence":"additional","affiliation":[]},{"given":"Carroll","family":"Morgan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-78499-9_31","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Braun","year":"2008","unstructured":"Braun, C., Chatzikokolakis, K., Palamidessi, C.: Compositional methods for information-hiding. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 443\u2013457. Springer, Heidelberg (2008)"},{"key":"19_CR2","series-title":"ENTCS","volume-title":"Proc. MFPS","author":"C. Braun","year":"2009","unstructured":"Braun, C., Chatzikokolakis, K., Palamidessi, C.: Quantitative notions of leakage for one-try attacks. In: Proc. MFPS. ENTCS, vol.\u00a0249, Elsevier, Amsterdam (2009)"},{"key":"19_CR3","first-page":"341","volume-title":"Proc. CSF","author":"K. Chatzikokolakis","year":"2007","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Probability of error in information-hiding protocols. In: Proc. CSF, pp. 341\u2013354. IEEE, Los Alamitos (2007)"},{"issue":"1","key":"19_CR4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The Dining Cryptographers problem: Unconditional sender and recipient untraceability. Jnl. Cryptol.\u00a01(1), 65\u201375 (1988)","journal-title":"Jnl. Cryptol."},{"key":"19_CR5","first-page":"75","volume-title":"Proc. IEEE Symp on Security and Privacy","author":"J.A. Goguen","year":"1984","unstructured":"Goguen, J.A., Meseguer, J.: Unwinding and inference control. In: Proc. IEEE Symp on Security and Privacy, pp. 75\u201386. IEEE, Los Alamitos (1984)"},{"key":"19_CR6","unstructured":"Probabilistic\u00a0Systems Group, http:\/\/www.cse.unsw.edu.au\/~carrollm\/probs"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., Basin, D.: An information-theoretic model for adaptive side-channel attacks. In: Proc. 14th ACM Conf. Comp. Comm. Security (2007)","DOI":"10.1145\/1315245.1315282"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0022-0000(85)90012-1","volume":"30","author":"D. Kozen","year":"1985","unstructured":"Kozen, D.: A probabilistic PDL. Jnl. Comp. Sys. Sci.\u00a030(2), 162\u2013178 (1985)","journal-title":"Jnl. Comp. Sys. Sci."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Massey, J.L.: Guessing and entropy. In: Proc. IEEE International Symposium on Information Theory, p. 204 (1994)","DOI":"10.1109\/ISIT.1994.394764"},{"key":"19_CR10","unstructured":"McIver, A.K., Meinicke, L.A., Morgan, C.C.: Draft of this paper including its appendices [6, McIver:10]"},{"key":"19_CR11","unstructured":"McIver, A.K., Meinicke, L.A., Morgan, C.C.: Draft full version of this paper, http:\/\/www.comp.mq.edu.au\/~lmeinick\/icalp.pdf"},{"key":"19_CR12","series-title":"Tech. Mono. Computer Science","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems","author":"A.K. McIver","year":"2005","unstructured":"McIver, A.K., Morgan, C.C.: Abstraction, Refinement and Proof for Probabilistic Systems. Tech. Mono. Computer Science. Springer, Heidelberg (2005)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. FM 2009","author":"A.K. McIver","year":"2009","unstructured":"McIver, A.K., Morgan, C.C.: Sums and lovers: Case studies in security, compositionality and refinement. In: Cavalcanti, A., Dams, D. (eds.) Proc. FM 2009. LNCS, vol.\u00a05850, Springer, Heidelberg (2009), Treats Two-Party Secure Computation"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Morgan, C.C.: The Shadow Knows: Refinement of ignorance in sequential programs. Science of Computer Programming\u00a074(8) (2009), Treats Oblivious Transfer","DOI":"10.1016\/j.scico.2007.09.003"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-44495-5_7","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"J.O. Pliam","year":"2000","unstructured":"Pliam, J.O.: On the incomparability of entropy and marginal guesswork in brute-force attacks. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 67\u201379. Springer, Heidelberg (2000)"},{"key":"19_CR16","unstructured":"Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initialiser. Technical report, M.I.T. (1999), http:\/\/theory.lcs.mit.edu\/~rivest\/Rivest-commitment.pdf"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell System Technical Journal"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-78663-4_25","volume-title":"Trustworthy Global Computing","author":"G. Smith","year":"2008","unstructured":"Smith, G.: Adversaries and information leaks. In: Barthe, G., Fournet, C. (eds.) TGC 2007 and FODO 2008. LNCS, vol.\u00a04912, pp. 383\u2013400. Springer, Heidelberg (2008)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Trustrum, K.: Linear Programming. Library of Mathematics. Routledge and Kegan Paul, London (1971)","DOI":"10.1007\/978-94-010-9462-7"},{"key":"19_CR20","first-page":"160","volume-title":"Proc. FOCS 1982","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: Proc. FOCS 1982, pp. 160\u2013164. IEEE, Los Alamitos (1982)"}],"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-14162-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:06Z","timestamp":1606186086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}