The Secrecy Controls Of The Bellla Padula Model

1052 Words Mar 5th, 2015 5 Pages
1)Write a set of rules combining the secrecy controls of the BellLa Padula model with the integrity controls of the Biba model.
Bell-LaPadula Model is a formal state- transition model of computer security policy that describes a set of access control rules for some objects. It s an access control model for protecting confidentiality. It has been proven that as the information flows from one object to another the system remains in a secure state. We can say that information prohibited in one state is also prohibited in all other reachable states.
There are three properties in BLP model:
1) Discretionary Security Property.
2)Simple-Security Property-no read up.
3)Stac Property-no write down.
If a secure system satisfies all these properties, BLP model will include some proof that the system will remain secure.
Access permissions are defined through an "Access control Matrix" and through a partial ordering of security levels. Security policies will prevent the information from flowing downwards from high security level to a low security level. This model only contains the information flow which occurs when a subject attends an object.
What is in the Model:
1) All current access operations:
• An access operation is described by the tuple (s,o,a).
• S -> subject, 0 -> object , A -> access operations.
• The set of all current access operations is an element of P(SXOXA).
• We use B has shorthand for P (SXOXA).
• We use b to donate a particular set of access.
2)The current…
Open Document