Lattice-based access control

In computer security, lattice-based access control (LBAC) is a complex access control based on the interaction between any combination of objects (such as resources, computers, and applications) and subjects (such as individuals, groups or organizations).

In this type of label-based mandatory access control model, a lattice is used to define the levels of security that an object may have and that a subject may have access to. The subject is only allowed to access an object if the security level of the subject is greater than or equal to that of the object.

Mathematically, the security level access may also be expressed in terms of the lattice (a partial order set) where each object and subject have a greatest lower bound (meet) and least upper bound (join) of access rights. For example, if two subjects "A" and "B" need access to an object, the security level is defined as the meet of the levels of "A" and "B". In another example, if two objects "X" and "Y" are combined, they form another object "Z", which is assigned the security level formed by the join of the levels of "X" and "Y".

LBAC is known as a label-based access control restriction as opposed to role-based access control (RBAC).

Lattice based access control models were first formally defined by Denning (1976); see also Sandhu (1993).

References

*cite journal
author = Denning, Dorothy E.
authorlink = Dorothy E. Denning
title = A lattice model of secure information flow
journal = Communications of the ACM
volume = 19
issue = 5
year = 1976
pages = 236–243
doi = 10.1145/360051.360056

*cite journal
author = Sandhu, Ravi S.
title = Lattice-based access control models
journal = IEEE Computer
year = 1993
volume = 26
issue = 11
pages = 9–19
doi = 10.1109/2.241422
url = http://ite.gmu.edu/list/journals/computer/i93lbacm.ps

See also

*Mandatory access control
*Bell-LaPadula model
*Biba Model
*Computer security model