Lattice-based access control
In computer security, lattice-based access control (LBAC) is a complex method for limiting information access based on any combination of objects (such as resources, computers, and applications) and subjects (such as individuals, groups or organizations).
In this type of 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. That is, we define a partial order on the security levels, in such a way that any two security levels always have a greatest lower bound (meet) and least upper bound (join). If two objects A and B are combined to form another object C, that object is assigned a security level formed by the join of the levels of A and B, and if two subjects need to jointly access some secure data, their access level is defined to be the meet of the subjects' levels. A subject is allowed to access an object only if the security level of the subject is greater than or equal to that of the object, in the partial order defining the lattice.
LBAC is known as a more specific set of access control restrictions and is more general than role-based access control (RBAC).
Lattice based access control models were first formally defined by Denning (1976); see also Sandhu (1993).
References
- Denning, Dorothy E. (1976). "A lattice model of secure information flow". Communications of the ACM. 19 (5): 236–243. doi:10.1145/360051.360056.
- Sandhu, Ravi S. (1993). "Lattice-based access control models". IEEE Computer. 26 (11): 9–19. doi:10.1109/2.241422.
See also
 | This programming-language-related article is a stub. You can help Wikipedia by expanding it. |