D’Souza, Deepak and Holla, Raveendra and Kulkarni, Janardhan and Raghavendra, KR and Sprick, Barbara (2008) On the Decidability of Model-Checking Information Flow Properties. In: ICISS 2008, Hyderabad, Hyderabad.
On_the_Decidability.pdf - Published Version
Restricted to Registered users only
Download (199Kb) | Request a copy
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: 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 . 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|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||23 Sep 2011 09:16|
|Last Modified:||23 Sep 2011 09:16|
Actions (login required)