Formalisation and implementation of access control models

Access control software must be based on a security policy model. Flaws in them may come from a lack of precision or some incoherences in the policy model or from inconsistencies between the model and the code. In this paper, we first present a formalisation of access control models based on the work on an algebra of security models by J. McLean (1988). Then, we describe the implementation of this framework and show how it can be used to obtain a particular security model: the Bell and La Padula security model. Last, as an example, we show how such a program can be integrated for secure databases. All our development is done within the Focal (Rioboo et al., 2004) programming environment which provides a language with object-oriented features allowing to write formal specifications, proofs and programs at the same level.

[1]  Leonard J. LaPadula,et al.  MITRE technical report 2547, volume II , 1996 .

[2]  Len LaPadula,et al.  Secure Computer Systems: A Mathematical Model , 1996 .

[3]  Paul Douglas,et al.  Proceedings International Conference on Information Technology: Coding and Computing , 2002, Proceedings. International Conference on Information Technology: Coding and Computing.

[4]  Damien Doligez,et al.  Algorithms and Proofs Inheritance in the FOC Language , 2003, Journal of Automated Reasoning.

[5]  E. Gureghian,et al.  A full formalisation of the Bell and La Padula security model , 2003 .

[6]  Claudia Eckert.  On security models , 1996, SEC.

[7]  John McLean,et al.  The algebra of security , 1988, Proceedings. 1988 IEEE Symposium on Security and Privacy.

[8]  John McLean,et al.  Security models and information flow , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[9]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .