Abstract
Bellman’s optimality principle is a method for solving problems where one needs to find best decisions one after another. The principle can be extended to assess the information leakage in multi-threaded programs, and is formalized into the optimum leakage principle hereby proposed in this paper. By modeling the state transitions in multi-threaded programs, the principle is combined with information theory to assess the leakage in multi-threaded programs, as the result of an optimal policy. This offers a new perspective to measure the information leakage and enables to track the leakage at run-time. Examples are given to demonstrate the analysis process. Finally, efficient implementation of this methodology is also briefly discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhargava, M., Palamidessi, C.: Probabilistic Anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 171–185. Springer, Heidelberg (2005)
Bellman, R.: On the Theory of Dynamic Programming. In: Proceedings of the National Academy of Sciences (1952)
Braun, C., Chatzikokolakis, K., Palamidessi, C.: Quantitative notions of leakage for one-try attacks. In: Proceedings of MFPS 2009 (2009)
Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity Protocols as Noisy Channels. Postproceedings of the Symp. on Trustworthy Global Computing. LNCS. Springer, Heidelberg (2006)
Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: On the bayes risk in information-hiding protocols. Journal of Computer Security 16(5), 531–571 (2008)
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–45. Aix-en-Provence, France (2005)
Cover, T., Thomas, J.: Elements of Information Theory. John Wiley&Sons, Inc., Hoboken (2006)
Denning, D.E.: Cyptography and Data Security. Addison-Wesley, Reading (1982)
Denning, D.E.: A lattice model of secure information flow. Communications of the ACM 19(5) (May 1976)
Di Pierro, A., Hankin, C., Wiklicky, H.: Measuring the confinement of probabilistic systems. Theoretical Computer Science 340(1), 3–56 (2005)
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)
Chen, H., Malacaria, P.: Quantifying Maximal Loss of Anonymity in Protocols. In: Proceedings of ASIACCS 2009, Sydney, NSW, Australia, March 10-12 (2009)
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)
Chen, H., Malacaria, P.: Studying Maximum Information Leakage Using Karush–Kuhn–Tucker Conditions. In: Proceedings of the 7th International Workshop on Security Issues in Concurrency
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 15 (2007)
Clark, D., Hunt, S., Malacaria, P.: Quantitative Analysis of the leakage of confidential data. Electronic Notes in Theoretical Computer Science 59 (2002)
Clark, D., Hunt, S., Malacaria, P.: Quantified interference for a while language. Electronic Notes in Theoretical Computer Science 112, 149–166 (2005)
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)
Lowe, G.: Quantifying information flow. In: Proceedings of the Workshop on Automated Verification of Critical Systems (2001)
Mclean, J.: Security models and information flow. In: Proceedings of the 1990 IEEE Symposium on Security and Privacy. Oakland, California (May 1990)
Millen, J.: Covert channel capacity. In: Proceedings of the 1987 IEEE Symposium on Research in Security and Privacy (1987)
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)
Malacaria, P.: Assessing security threats of looping constructs. In: Proceedings of ACM Symposium on Principles of Programming Language (2007)
Malacaria, P.: Risk Assessment of Security Threats for Looping Constructs. Journal of Computer Security (2009)
Puterman, M.L.: Markov decision processes: discrete stochastic dynamic programming., 2nd edn., illustrated. Wiley-Interscience, Hoboken (2005)
Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings of IEEE Computer Security Foundations Workshop, July 2000, pp. 200–214 (2000)
Shannon, C.E., Weaver, W.: A Mathematical Theory of Communication. Univ. of Illinois Press, Urbana (1963)
Smith, G.: On the Foundation of Quantitative Information Flow. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 288–302. Springer, Heidelberg (2009)
Chatzikokolakis, K., Chothia, T., Guha, A.: Calculating Probabilistic Anonymity from Sampled Data (manuscript) (2009), http://www.cs.bham.ac.uk/~tpc/Papers/CalcProbAnon.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, H., Malacaria, P. (2010). The Optimum Leakage Principle for Analyzing Multi-threaded Programs. In: Kurosawa, K. (eds) Information Theoretic Security. ICITS 2009. Lecture Notes in Computer Science, vol 5973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14496-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-14496-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14495-0
Online ISBN: 978-3-642-14496-7
eBook Packages: Computer ScienceComputer Science (R0)