On the Decidability of Model-Checking Information Flow Properties
Data(s) |
2008
|
---|---|
Resumo |
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 [8]. 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. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/40708/1/On_the_Decidability.pdf 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. |
Publicador |
Springer |
Relação |
http://www.springerlink.com/content/3q7484822n100821/ http://eprints.iisc.ernet.in/40708/ |
Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
Tipo |
Conference Paper PeerReviewed |