Algorithmic Verification of Noninterference Properties

Electronic Notes in Theoretical Computer Science

Volumn 168, Issue SPEC. ISS., 2007, Pages 61-75

  van der Meyden, Ron ^a,b   Zhang, Chenyi ^a,b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b CSIRO   (Australia)

Author keywords

complexity; heuristics; model checking; noninterference

Indexed keywords

FINITE AUTOMATA; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SIGNAL INTERFERENCE;

MODEL CHECKING; NONDEDUCIBILITY; NONINTERFERENCE; RESTRICTIVENESS;

COMPUTATIONAL COMPLEXITY;

EID: 33846606100     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.11.002     Document Type: Article

References (30)

1. Alpern B., and Schneider F.B. Defining liveness. Information Processing Letters 21 (1985) 181-185
2. Barthe, G., P.R. D'Argenio and T. Rezk, Secure Information Flow by Self-Composition, in: 17th IEEE Computer Security Foundation Workshop (2004), pp. 100-114
3. Bevier, W.R. and W.D. Young, A State-Based Approach to Noninterference, in: Proc. 7th Computer Security Foundations Workshop, 1994, pp. 11-21
4. Bossi, A., R. Focardi, C. Piazza and S. Rossi, Bisimulation and Unwinding for Verifying Possibilistic Security Properties, in: Proc. of Int. Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'03), 2003
5. Bryant R.E. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35 (1986) 677-691
6. Darvas, A., R. Hähnle and D. Sands, A Theorem Proving Approach to Analysis of Secure Information Flow, in: Workshop on Issues in the Theory of Security, (WITS'03), 2003
7. Fisler, K. and M.Y. Vardi, Bisimulation and Model Checking, in: Conference on Correct Hardware Design and Verification Methods (CHARME'99), 1999, pp. 338-341
8. Focardi R., and Gorrieri R. A Classification of Security Properties for Process Algebras. Journal of Computer Security 1 (1995) 5-33 IOS Press
9. Focardi, R. and R. Gorrieri, The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties, Technical Report UBLCS-96-14, Università di Bologna (1996)
10. Focardi, R., C. Piazza and S. Rossi, Proofs Methods for Bisimulation Based Information Flow Security, in: Proc. of Int. Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'02), 2002, pp. 16-31
11. Garey M.R., and Johnson D.S. Computers and Intractability - A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company
12. Goguen, J. and J. Meseguer, Security Policies and Security Models, in: IEEE Symp. on Security and Privacy, 1982, pp. 11-20
13. Goguen, J. and J. Meseguer, Unwinding and Inference Control, in: IEEE Symp. on Security and Privacy, 1984
14. Greve, D., M. Wilding and W. van Fleet, A Separation Kernel Formal Security Policy, in: ACL2 Workshop, 2003
15. Johnson, D.M. and F.J. Thayer, Security and the composition of machines, in: Proc. IEEE Computer Security Foundations Workshop, 1988, pp. 72-89
16. Kanellakis, P.C. and S.A. Smolka, CCS Expressions, Finite State Processes, and Three Problems of Equivalence, in: Proc. 2nd Annual ACM Symposium on Principles of Distributed Computing, New York, NY, 1983, pp. 228-240
17. McCullough, D., Specifications for Multi-Level Security and a Hook-Up Property, in: Proc. IEEE Symp. on Security and Privacy, 1987, pp. 161-166
18. McCullough, D., Noninterference and the composability of security properties, in: Proc. IEEE Symp. on Security and Privacy, 1988, pp. 177-186
19. McCullough D. A hookup theorem for multi-level security. IEEE Transactions on Software Engineering 16 (1990) 563-568
20. McLean, J., A General Theory of Composition for Trace Sets Closed Under Selective Interleaving Functions, in: Proc. IEEE Symp. on Security and Privacy, 1994, pp. 79-93
21. Oheimb D.v. Information flow control revisited: Noninfluence = Noninterference + Nonleakage. Computer Security - ESORICS'04. LNCS 3193 (2004) 225-243
22. Paige R., and Tarjan R. Three Partition Refinement Algorithms. SIAM Journal of Computing 16 (1987) 973-989
23. Roscoe, A., CSP and determinism in security modelling, in: Proc. IEEE Symp. on Security and Privacy, 1995, pp. 114-221
24. Rushby, J., Proof of Separability - a Verification Technique for a Class of Security Kernels, in: Proc. 5th International Symposium on Programming, Turin, Italy, 1982, pp. 352-367
25. Rushby, J., Noninterference, Transitivity, and Channel-Control Security Policies, Technical report, SRI international (1992). URL http://www.csl.sri.com/papers/csl-92-2/
26. Sutherland, D., A model of information, in: Proc. 9th National Computer Security Conference, 1986, pp. 175-183
27. Tarski A. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. (1955) 285-309
28. van der Meyden, R. and C. Zhang, A comparison of semantic models for noninterference, in: 4th International Workshop in Formal Aspects in Security and Trust (FAST'06), 2006, to appear, available at http://www.cse.unsw.edu.au/~czhang/fast.ps
29. Wittbold, J.T. and D.M. Johnson, Information flow in nondeterministic systems, in: Proc. IEEE Symp. on Security and Privacy, 1990, pp. 144-161
30. Zakinthinos, A. and E. Lee, A general theory of security properties, in: Proc. IEEE Symp. on Security and Privacy, 1997, pp. 94-102