Decidability of parameterized probabilistic information flow

Authors:
Danièle Beauquier;Marie Duflot;Yury Lifshits
Affiliations:
University Paris 12, France;University Paris 12, France;Steklov Institute of Mathematics, St. Petersburg, Russia
Venue:
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Year:
2007

Citing 7
Cited 0

The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties

IEEE Transactions on Software Engineering
Probabilistic noninterference in a concurrent language

Journal of Computer Security
Probabilistic Noninterference for Multi-Threaded Programs

CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Secrecy in Multiagent Systems

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Quantifying Information Flow

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A process-algebraic approach for the analysis of probabilistic noninterference

Journal of Computer Security
A probabilistic property-specific approach to information flow

MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security

Quantified Score

Hi-index	0.00

Visualization

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?