ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On the Decidability of Model Checking Information Flow Properties

DSouza, D and Holla, R and Kulkarni, J and Raghavendra, KR and Sprick, B (2008) On the Decidability of Model Checking Information Flow Properties. In: 4th International Conference on Information Systems Security, ICISS, 16 - 20 December 2008.

[img] PDF
iciss.pdf - Published Version
Restricted to Registered users only

Download (211kB) | Request a copy
Official URL: http://www.springerlink.com/content/3q7484822n1008...


Current standard security practices do not provide substantial assurance about information flow security: the end-to-end behavior of a computing system. Noninterference is the basic semantical condition used to account for information flow security. In the literature, there are many definitions of noninterference for nondeterministic systems: Non-inference, Separability and so on. Mantel presented a framework of Basic Security Predicates (BSPs) for characterizing the definitions of noninterference in the literature. Model-checking these BSPs for finite state systems was shown to be decidable in our earlier paper. In this paper, we show that verifying these BSPs for the more expressive system model of pushdown systems is undecidable. We also give an example of a simple security property which is undecidable even for finite-state systems: the property is a weak form of non-inference called WNI, which is not expressible in Mantel’s BSP framework.

Item Type: Conference Paper
Series.: Lecture Notes in Computer Science
Publisher: Springer
Additional Information: The copyright of this article belongs to Springer
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 24 Sep 2008 11:14
Last Modified: 01 Jun 2022 04:50
URI: https://eprints.iisc.ac.in/id/eprint/15995

Actions (login required)

View Item View Item