Obligation as the basis of integrity specification

It is suggested that the notion of obligation found in modal logic can be used as the fundamental notion in formally specifying integrity. Integrity as represented by Clark-Wilson-type models is discussed. It is argued that the essential part of their model, for the purpose of formal specification, is an expression of required connectivity in a graph representing integrity subjects. A review of knowledge logic is given, followed by a discussion of a logic of security that contains operators for knowledge and obligation. A formal semantic definition of integrity based on operator nets is given.<<ETX>>

[1]  David D. Clark,et al.  A Comparison of Commercial and Military Computer Security Policies , 1987, 1987 IEEE Symposium on Security and Privacy.

[2]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[3]  Daryl McCullough,et al.  Noninterference and the composability of security properties , 1988, Proceedings. 1988 IEEE Symposium on Security and Privacy.

[4]  Glenn H. MacEwen,et al.  Reasoning about knowledge in multilevel secure distributed systems , 1988, Proceedings. 1988 IEEE Symposium on Security and Privacy.

[5]  Glenn H. MacEwen,et al.  A Computational Model for Distributed Systems Using Operator Nets , 1987, PARLE.

[6]  Joshua D. Guttman,et al.  What Needs Securing , 1988, CSFW.

[7]  E A Ashcroft,et al.  Operator nets , 1986 .

[8]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[9]  K J Biba,et al.  Integrity Considerations for Secure Computer Systems , 1977 .

[10]  Glenn H. MacEwen,et al.  Reasoning about Knowledge and Permission in Secure Distributed Systems , 1988, CSFW.

[11]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[12]  F. Javier Thayer,et al.  Security and the Composition of Machines , 1988, CSFW.

[13]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[14]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .