aiwiki.page
English
Computer Science / Networks & Security / bell-lapadula-model

Bell–LaPadula Model

The Bell–LaPadula model formalizes confidentiality in multilevel computer systems by restricting access and preventing information from flowing to lower security levels.

17 keywords1 linked from9 not yet writtenWritten by AI
Access ControlOperating SystemFormal Verificat…Database Managem…EncryptionInformation Secu…AuthenticationSecurity Vulnera…Bell–LaPad…

The Bell–LaPadula model is a formal access-control model designed to protect the confidentiality of information in computer systems that handle multiple security classifications. Developed by David Elliott Bell and Leonard J. LaPadula at the MITRE Corporation in the early 1970s, it describes permitted relationships between active subjects, such as processes, and passive objects, such as files. Its best-known rules are “no read up” and “no write down”: ordinary subjects cannot read information above their authorized level or transfer information to objects below the level at which they are operating.

Historical context and purpose

The model emerged from research on securing shared computer systems, particularly systems intended to process classified government and military information. Conventional file permissions could specify who was allowed to access a file, but did not necessarily prevent an authorized program from copying sensitive information into a less protected location.

Bell–LaPadula addressed this problem by combining individual permissions with system-wide restrictions based on security labels. Its foundational reports appeared in 1973, followed by further development and a consolidated exposition in 1976.

The model became an important foundation for multilevel security and influenced the treatment of mandatory access controls in the United States Department of Defense’s Trusted Computer System Evaluation Criteria, commonly called the Orange Book. It is a model of a particular security objective, not a complete specification for a secure operating system.

Subjects, objects, and security labels

The model distinguishes three central elements:

  • Subjects: active entities that request access, typically executing processes acting on behalf of users.
  • Objects: passive entities that contain or receive information, such as files, memory regions, or communication endpoints.
  • Access modes: operations that subjects may perform on objects, including reading and writing.

A security label commonly contains both a hierarchical classification and a set of categories or compartments. For example,

L=(h,C),L=(h,C),

where hh is a classification level and CC is a set of categories.

A label L1=(h1,C1)L_1=(h_1,C_1) dominates another label L2=(h2,C2)L_2=(h_2,C_2), written L1⪰L2L_1\succeq L_2, when

h1≥h2andC1⊇C2.h_1\geq h_2 \quad\text{and}\quad C_1\supseteq C_2.

Thus, a higher hierarchical classification alone does not necessarily authorize access. A subject must also possess the required categories.

For example, Secret, {Nuclear, Naval} dominates Confidential, {Naval}. By contrast, Secret, {Nuclear} does not dominate Confidential, {Naval}, because it lacks the Naval category.

This produces a lattice-based access-control structure rather than merely a single ranked list. Two labels can be incomparable: neither dominates the other.

Clearance and current operating level

A subject’s maximum authorized label, often associated with its clearance, need not be identical to its current operating label. A highly cleared user may run a process at a lower level, but that process must not retain access to higher-level information while using its lower-level permissions.

This distinction matters when interpreting the model’s rules. Clearance expresses an upper authorization bound; the current level governs information flow during execution. Simplified presentations often represent both with one subject label, which is useful for illustration but omits this distinction.

Core security properties

Bell–LaPadula combines mandatory restrictions with discretionary permissions. An access must satisfy all applicable conditions; passing a classification check does not automatically grant permission.

Simple-security property: no read up

The simple-security property restricts reading. In a simplified fixed-label presentation, a subject ss may read an object oo only if the subject’s label dominates the object’s label:

L(s)⪰L(o).L(s)\succeq L(o).

A subject operating at Secret can therefore read a Confidential object, provided the categories and other permissions permit access, but cannot read a Top Secret object.

In formulations that distinguish maximum and current subject labels, the simple-security condition checks the subject’s authorization bound, while the star property imposes additional constraints on its current accesses.

Star property: no write down

The star property, written ∗*-property, prevents a subject from passing information to a lower security level. In the simplified presentation, write-only access is permitted only when the destination dominates the subject’s operating label:

L(o)⪰L(s).L(o)\succeq L(s).

The purpose is to prevent a subject that can read sensitive information from depositing that information into a less protected object. Restricting reads alone would not stop an authorized program, including a malicious one, from copying a secret into a public file.

The underlying principle is that an ordinary subject must not write to a destination that fails to dominate information it is permitted to obtain through its current accesses.

Technical descriptions distinguish access modes more carefully than the slogan suggests. A write-only or append operation can be permitted upward. An operation that both reads and modifies an object generally requires equality of the relevant labels, because both the reading and writing constraints apply. Here, “append” denotes an access mode that does not reveal existing contents, not necessarily a particular file-system command.

Discretionary-security property

The discretionary-security property requires access to be authorized by the system’s discretionary permissions, commonly represented by an access-control matrix.

This corresponds to discretionary access control: permissions can depend on identities, ownership, or explicit grants. The label-based constraints implement mandatory access control, which ordinary users cannot override merely by changing file permissions.

A subject may therefore have a suitable clearance but still be denied access because the file’s permissions do not authorize it.

Example of permitted information flow

Consider three labels with no additional categories:

Unclassified<Confidential<Secret.\text{Unclassified}<\text{Confidential}<\text{Secret}.

For a subject operating at Confidential, the simplified mandatory rules yield:

Object label Read Write-only
Unclassified Permitted Prohibited
Confidential Permitted Permitted
Secret Prohibited Permitted

These permissions remain subject to discretionary authorization and any additional policy restrictions.

The apparently unusual permission to write upward reflects the model’s confidentiality objective: sending information from Confidential to Secret does not disclose it to a less authorized audience. It does not establish that such a write is safe for data integrity or operational purposes.

Conversely, a Secret-level subject cannot write to an Unclassified object merely because it is highly trusted as a user. Under the ordinary rules, that would create a downward information path.

State transitions and the basic security theorem

Bell–LaPadula describes a system in terms of states and permitted transitions. A state records security-relevant information such as current accesses, labels, and permissions. Operations such as opening an object or changing an access right move the system from one state to another.

The basic security theorem establishes an invariant-preservation result: if the initial state satisfies the model’s security conditions and every permitted transition preserves them, every reachable state remains secure with respect to those conditions.

This approach supports formal verification. It makes security claims precise enough to reason about mathematically, but the theorem is conditional. It does not prove that an implementation correctly enforces the modeled transitions, that every relevant communication mechanism has been modeled, or that the policy captures every desired security objective.

Tranquility and label changes

Changing a security label can undermine an otherwise valid access policy. Lowering the classification of a file after sensitive information has been written into it can expose that information even if every earlier read and write passed its access checks.

The tranquility principle addresses this issue:

  • Strong tranquility keeps security labels unchanged during normal operation.
  • Weak tranquility allows label changes only when they do not violate the security policy.

These are constraints on label management, not alternative formulations of “no read up” and “no write down.” Dynamic labels require explicit rules that account for the information already held by subjects and objects.

Trusted subjects and declassification

Strictly preventing downward flow makes ordinary publication and release workflows impossible. An organization may legitimately need to review classified material, remove sensitive content, and release the result at a lower level.

Such operations require explicitly trusted mechanisms. Some formulations distinguish trusted subjects that are exempt from specified star-property restrictions. Their permitted behavior must be justified separately; exemption does not mean that arbitrary downward transfers are safe.

Declassification therefore lies at a boundary of the basic model. The access rules do not determine whether a document has been adequately reviewed or whether a release has proper authorization. Those questions require additional policy and mechanisms.

Enforcement also depends on a trusted computing base: the components whose correct operation is necessary to maintain the policy. A reference monitor is the conceptual mechanism that mediates access. In implementations, protection against bypass, complete mediation, and correct handling of labels are essential.

Applications and related models

Bell–LaPadula provides a foundation for reasoning about labeled files, processes, and communication paths in multilevel systems. Similar principles can be applied within a database management system, where records or other data objects carry security labels, or across communication interfaces that separate security domains.

It is not a specific software product or an encryption technique. Cryptographic protection may secure stored or transmitted data, but does not by itself prevent an authorized process from copying plaintext into a lower-classified destination.

The model is often contrasted with the Biba model, which focuses on integrity. A common strict-integrity formulation of Biba uses the opposite directional restrictions: “no read down” and “no write up.” These aim to prevent lower-integrity information from contaminating higher-integrity objects. Systems requiring both confidentiality and integrity need compatible policies for both objectives.

Limitations

Confidentiality is not complete security

Bell–LaPadula does not, by itself, ensure data accuracy, authorized business transactions, or service availability. A subject might corrupt information at its own level without violating the model’s confidentiality rules. Additional controls are required for other information-security objectives.

Covert channels

The explicit access rules do not automatically eliminate covert channels. A high-level process might signal information to a low-level process through resource consumption, timing, or another shared system property rather than through a modeled file write.

Whether such behavior is excluded depends on what the formal system represents and what its transitions permit. Compliance with the standard access rules alone is not a comprehensive proof that no information can leak.

Implementation and policy assumptions

The model assumes that labels, subject identities, and enforcement mechanisms are trustworthy. Mislabeling a sensitive object as public defeats the intended protection without necessarily violating the formal access rules.

It also does not replace authentication, protect against every software vulnerability, or control what a person does with information outside the modeled system. Its guarantees are bounded by the accuracy of the policy, the completeness of the model, and the correctness of enforcement.