A Logical View of Secure Dependencies^*

Article type: Research Article

Authors: Bieber, Pierre | Cuppens, Frédéric

Affiliations: ONERA-CERT, 2 Av. E. Belin, 31055, Toulouse Cedex, France, email: [email protected]

Note: [*] This work was supported by DRET

Abstract: In the context of the modal logic of security, confidentiality is defined by the formula KBφ→RBφ that could be read “If B knows φ then B should have the permission to know φ”. We propose a new semantics for the RB modal operator, such that the definition of security would allow a certain number of dependencies (called secure dependencies) between objects of the system. We formally compare this new definition of security with non-interference, non-deducibility and generalized non-interference, especially with respect to assumptions of non-determinism and input-totalness.

DOI: 10.3233/JCS-1992-1105

Journal: Journal of Computer Security, vol. 1, no. 1, pp. 99-129, 1992