Abstract
In this paper, we consider the decidability of two problems related to information flow in a system with respect to some property. A flow occurs in a system if the conditional probability of the property under some partial observation differs from the a priori probability of that property. For systems modelled as finite Markov chains we prove that the two following problems are decidable: does a system has information flow for a given regular property? is it true that the system has no information flow for any (sequential) property?
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
Aldini, A., Bravetti, M., Gorrieri, R.: A process-algebraic approach for the analysis of probabilistic noninterference. Journal of Computer Security 12, 191–246 (2004)
Duflot, M., Beauquier, D., Lifshits, Y.: Decidability of parameterized probabilistic information flow. Technical report, LACL - Univ. Paris 12 (2007), http://www.univ-paris12.fr/lacl/duflot/publis.html
Duflot, M., Beauquier, D., Minea, M.: A probabilistic property-specific approach to information flow. In: Gorodetsky, V., Kotenko, I., Skormin, V.A. (eds.) MMM-ACNS 2005. LNCS, vol. 3685, pp. 206–220. Springer, Heidelberg (2005)
Focardi, R., Gorrieri, R.: The compositional security checker: A tool for the verification of information flow security properties. Software Engineering 23(9), 550–571 (1997)
Gray III, J.W.: Probabilistic interference. In: Proc. IEEE Symp. on Security and Privacy, pp. 170–179 (May 1990)
Gray III, J.W.: Toward a mathematical foundation for information flow security. In: Proc. 1991 IEEE Symp. on Security and Privacy, pp. 21–35. IEEE Comp. Soc. Press, Los Alamitos (1991)
Halpern, J.Y., O’Neill, K.R.: Secrecy in multiagent systems. In: Proc. IEEE Computer Security Foundations Workshop, p. 32. IEEE Computer Society Press, Los Alamitos (2002)
Kemeny, J.G., Snell, J.L.: Finite Markov Chains. D Van Nostad Co., Inc., Princeton, NJ (1960)
Lowe, G.: Quantifying information flow. In: Proc. IEEE Computer Security Foundations Workshop, pp. 18–31. IEEE Computer Society Press, Los Alamitos (2002)
McLean, J.: Security models and information flow. In: Proc. IEEE Symp. on Security and Privacy, pp. 180–187. IEEE Computer Society Press, Los Alamitos (1990)
Perrin, D., Pin, J.E.: Infinite words. In: Pure and Applied Mathematics, vol. 141, Elsevier, Amsterdam (2004)
Maggiolo-Schettini, A., Lanotte, R., Troina, A.: Information flow analysis for probabilistic timed automata. In: Workshop on Formal Aspects in Security and Trust (FAST). IFIP International Federation for Information Processing, vol. 12, pp. 1–15 (2004)
Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proc. IEEE Computer Security Foundations Workshop, pp. 200–214. IEEE Computer Society Press, Los Alamitos (2000)
Slissenko, A.: Probability and time in measuring security. In: Ţiplea, F.L., Clarke, E., Minea, M., Ţiplea, F.L. (eds.) VISSAS 2005. Proc. of NATO Adv. Research Work.: Verification of Infinite-State Systems with Applications to Security. NATO Security through Science Series. D: Information and Communication Security, vol. 1, pp. 169–183. IOS Press, Amsterdam (2006)
Volpano, D., Smith, G.: Probabilistic noninterference in a concurrent language. Journal of Computer Security 7, 231–253 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, D., Duflot, M., Lifshits, Y. (2007). Decidability of Parameterized Probabilistic Information Flow. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74510-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74509-9
Online ISBN: 978-3-540-74510-5
eBook Packages: Computer ScienceComputer Science (R0)