{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:08Z","timestamp":1725565388455},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144950"},{"type":"electronic","value":"9783642144967"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14496-7_15","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T11:51:35Z","timestamp":1284119495000},"page":"177-193","source":"Crossref","is-referenced-by-count":5,"title":["The Optimum Leakage Principle for Analyzing Multi-threaded Programs"],"prefix":"10.1007","author":[{"given":"Han","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasquale","family":"Malacaria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11539452_16","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"M. Bhargava","year":"2005","unstructured":"Bhargava, M., Palamidessi, C.: Probabilistic Anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 171\u2013185. Springer, Heidelberg (2005)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bellman, R.: On the Theory of Dynamic Programming. In: Proceedings of the National Academy of Sciences (1952)","DOI":"10.1073\/pnas.38.8.716"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Braun, C., Chatzikokolakis, K., Palamidessi, C.: Quantitative notions of leakage for one-try attacks. In: Proceedings of MFPS 2009 (2009)","DOI":"10.1016\/j.entcs.2009.07.085"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Postproceedings of the Symp. on Trustworthy Global Computing","author":"K. Chatzikokolakis","year":"2006","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity Protocols as Noisy Channels. Postproceedings of the Symp. on Trustworthy Global Computing. LNCS. Springer, Heidelberg (2006)"},{"issue":"5","key":"15_CR5","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. Journal of Computer Security\u00a016(5), 531\u2013571 (2008)","journal-title":"Journal of Computer Security"},{"key":"15_CR6","first-page":"31","volume-title":"Proceedings of 18th IEEE Computer Security Foundations Workshop","author":"R. Michael","year":"2005","unstructured":"Michael, R., Clarkson, A.C.: Myers, and Fred B. Schneider: Belief in information flow. In: Proceedings of 18th IEEE Computer Security Foundations Workshop, pp. 31\u201345. Aix-en-Provence, France (2005)"},{"key":"15_CR7","volume-title":"Elements of Information Theory","author":"T. Cover","year":"2006","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. John Wiley&Sons, Inc., Hoboken (2006)"},{"key":"15_CR8","volume-title":"Cyptography and Data Security","author":"D.E. Denning","year":"1982","unstructured":"Denning, D.E.: Cyptography and Data Security. Addison-Wesley, Reading (1982)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Denning, D.E.: A lattice model of secure information flow. Communications of the ACM\u00a019(5) (May 1976)","DOI":"10.1145\/360051.360056"},{"issue":"1","key":"15_CR10","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. Theoretical Computer Science\u00a0340(1), 3\u201356 (2005)","journal-title":"Theoretical Computer Science"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Gray III, J.W.: Toward a methematical foundataion for information flow security. In: Proceedings of the 1991 IEEE Symposium on Security and Privacy, Oakland, California (May 1991)","DOI":"10.1109\/RISP.1991.130769"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Chen, H., Malacaria, P.: Quantifying Maximal Loss of Anonymity in Protocols. In: Proceedings of ASIACCS 2009, Sydney, NSW, Australia, March 10-12 (2009)","DOI":"10.1145\/1533057.1533087"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Chen, H., Malacaria, P.: Quantitative Analysis of Leakage for Multi-threaded Programs. In: Proceedings of ACM 2007 workshop on Programming languages and analysis for security (2007)","DOI":"10.1145\/1255329.1255335"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Chen, H., Malacaria, P.: Studying Maximum Information Leakage Using Karush\u2013Kuhn\u2013Tucker Conditions. In: Proceedings of the 7th International Workshop on Security Issues in Concurrency","DOI":"10.4204\/EPTCS.7.1"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Clark, D., Hunt, S., Malacaria, P.: David Clark, Sebastian Hunt, Pasquale Malacaria: A static analysis for quantifying information flow in a simple imperative language. Journal of Computer Security\u00a015 (2007)","DOI":"10.3233\/JCS-2007-15302"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantitative Analysis of the leakage of confidential data. Electronic Notes in Theoretical Computer Science\u00a059 (2002)","DOI":"10.1016\/S1571-0661(04)00290-7"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.entcs.2004.01.018","volume":"112","author":"D. Clark","year":"2005","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantified interference for a while language. Electronic Notes in Theoretical Computer Science\u00a0112, 149\u2013166 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Backes, M., Kopf, B., Rybalchenko, A.: Automatic Discovery and Quantification of Information Leaks. In: Proceedings of the 30th IEEE Symposium on Security and Privacy, S&P 2009 (2009)","DOI":"10.1109\/SP.2009.18"},{"key":"15_CR19","unstructured":"Lowe, G.: Quantifying information flow. In: Proceedings of the Workshop on Automated Verification of Critical Systems (2001)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Mclean, J.: Security models and information flow. In: Proceedings of the 1990 IEEE Symposium on Security and Privacy. Oakland, California (May 1990)","DOI":"10.1109\/RISP.1990.63849"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Millen, J.: Covert channel capacity. In: Proceedings of the 1987 IEEE Symposium on Research in Security and Privacy (1987)","DOI":"10.1109\/SP.1987.10013"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Malacaria, P., Chen, H.: Lagrange Multipliers and Maximum Information Leakage in Different Observational Models. In: Proceedings of ACM SIGPLAN Third Workshop on Programming Languages and Analysis for Security (June 2008)","DOI":"10.1145\/1375696.1375713"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Malacaria, P.: Assessing security threats of looping constructs. In: Proceedings of ACM Symposium on Principles of Programming Language (2007)","DOI":"10.1145\/1190216.1190251"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Malacaria, P.: Risk Assessment of Security Threats for Looping Constructs. Journal of Computer Security (2009)","DOI":"10.3233\/JCS-2010-0360"},{"key":"15_CR25","volume-title":"Markov decision processes: discrete stochastic dynamic programming.","author":"M.L. Puterman","year":"2005","unstructured":"Puterman, M.L.: Markov decision processes: discrete stochastic dynamic programming., 2nd edn., illustrated. Wiley-Interscience, Hoboken (2005)","edition":"2"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings of IEEE Computer Security Foundations Workshop, July 2000, pp. 200\u2013214 (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"key":"15_CR27","volume-title":"A Mathematical Theory of Communication","author":"C.E. Shannon","year":"1963","unstructured":"Shannon, C.E., Weaver, W.: A Mathematical Theory of Communication. Univ. of Illinois Press, Urbana (1963)"},{"key":"15_CR28","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 Foundation of Quantitative Information Flow. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 288\u2013302. Springer, Heidelberg (2009)"},{"key":"15_CR29","unstructured":"Chatzikokolakis, K., Chothia, T., Guha, A.: Calculating Probabilistic Anonymity from Sampled Data (manuscript) (2009), http:\/\/www.cs.bham.ac.uk\/~tpc\/Papers\/CalcProbAnon.pdf"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14496-7_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:54:14Z","timestamp":1606186454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14496-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144950","9783642144967"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14496-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}