Model-checking trace-based information flow properties

Authors:
Deepak D'Souza;Raveendra Holla;K. R. Raghavendra;Barbara Sprick
Affiliations:
Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India. E-mails: {deepakd, raveendra, raghavendrakr}@csa.iisc.ernet.in;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India. E-mails: {deepakd, raveendra, raghavendrakr}@csa.iisc.ernet.in;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India. E-mails: {deepakd, raveendra, raghavendrakr}@csa.iisc.ernet.in;TU Darmdstadt, Fachbereich Informatik, Darmdstadt, Germany. E-mail: sprick@mais.informatik.tu-darmstadt.de
Venue:
Journal of Computer Security
Year:
2011

Citing 15
Cited 2

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

IEEE Transactions on Software Engineering
Certification of programs for secure information flow

Communications of the ACM
Automata and Computability

Automata and Computability
Noninterference for concurrent programs and thread systems

Theoretical Computer Science
A Per Model of Secure Information Flow in Sequential Programs

Higher-Order and Symbolic Computation
Bebop: A Symbolic Model Checker for Boolean Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Possibilistic Definitions of Security - An Assembly Kit

CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions

SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
A general theory of security properties

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Decidability and proof systems for language-based noninterference relations

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithmic Verification of Noninterference Properties

Electronic Notes in Theoretical Computer Science (ENTCS)
On the Decidability of Model-Checking Information Flow Properties

ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
An Automata Based Approach for Verifying Information Flow Properties

Electronic Notes in Theoretical Computer Science (ENTCS)

Towards incrementalization of holistic hyperproperties

POST'12 Proceedings of the First international conference on Principles of Security and Trust
Property-testing real-world authorization systems

Proceedings of the 18th ACM symposium on Access control models and technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of verifying trace-based information flow properties for different classes of system models. We begin by proposing an automata-theoretic technique for model-checking trace-based information flow properties for finite-state systems. We do this by showing that Mantel's Basic Security Predicates (BSPs), which were shown to be the building blocks of most trace-based properties in the literature, can be verified in an automated way for finite-state system models. We also consider the problem for the class of pushdown system models, and show that it is undecidable to check such systems for any of the trace-based information flow properties. Finally we consider a simple trace-based property we call “weak non-inference” and show that it is undecidable even for finite-state systems. (Work partially done while visiting Indian Institute of Science, Bangalore.)