Bell-LaPadula: No Read Up, No Write Down (CISSP)
The Bell-LaPadula rules in plain terms: no read up, no write down, and why a subject may write above its clearance but never read there.
How a system is built to be secure before anything is bolted on: the formal models that decide who may read and write what, the trusted computing base that enforces them, the cryptography underneath, and the design principles that hold when a real system gets messy.
The ISC2 CISSP exam outline lists these areas for Domain 3 and gives the domain a weighting of 13%. The wording below is a plain-English paraphrase; the outline itself is the source.
The Bell-LaPadula rules in plain terms: no read up, no write down, and why a subject may write above its clearance but never read there.
The Biba rules in plain terms: no read down, no write up, and why integrity inverts the Bell-LaPadula directions it is confused with.
How Clark-Wilson protects commercial integrity: the access triple, well-formed transactions, separation of duties, and how it differs from Biba.
How the Chinese Wall model stops consultant conflicts of interest: conflict classes, access that narrows as you read, and dynamic separation of duties.
The eight Graham-Denning operations for creating and deleting subjects and objects and transferring access rights, and where Harrison-Ruzzo-Ullman extends them.
What the trusted computing base includes, where its security perimeter sits, and how the reference monitor, security kernel and protection rings enforce it.
Fail safe defaults to open and protects people. Fail secure defaults to locked and protects assets. A CISSP insight on matching the default to the risk.
The confidentiality-only security model behind CISSP Domain 3: No Read Up (Simple Security Property) and No Write Down (Star Property) keep classified data from leaking downward.
The integrity counterpart to Bell-LaPadula: No Read Down and No Write Up stop trusted data from being contaminated by less trustworthy sources. Confidentiality is out of scope.
A commercial integrity model built on well-formed transactions and separation of duties: users change data only through certified programs, never directly. Access triple: subject, program, object.
The Brewer-Nash model: access rights change dynamically based on what a user has already accessed, blocking conflicts of interest between competing clients' data.
A security model defining eight primitive protection rights: how subjects and objects are securely created and deleted, and how access rights are granted, transferred, and revoked.
The Bell-LaPadula rule that a subject cannot read data classified above their clearance. Confidentiality's ceiling: a Secret clearance never opens a Top Secret file.
The Bell-LaPadula rule that a subject cannot write to a lower classification level, stopping cleared users from leaking secrets into documents that lower clearances can read.
The Biba rule that a subject cannot read data of lower integrity than its own, stopping trusted processes from being corrupted by unreliable input.
The Biba rule that a subject cannot write to a higher integrity level, stopping unreliable processes from injecting bad data into trusted records.
The abstract machine that mediates every access by every subject to every object against the security policy. A concept, not a product, defined by three properties.
The hardware, firmware and software inside the trusted computing base that implements the reference monitor concept in running code. The implementation, not the concept.
A hardware-enforced privilege hierarchy in which privilege increases inward: ring 0 holds the kernel and is most privileged, ring 3 holds user applications and is least privileged.
The total combination of hardware, firmware and software responsible for enforcing a system's security policy; if any part of it fails, every protection built on top of it fails.
A dedicated hardware chip that stores cryptographic keys, measures boot integrity, and seals secrets to a known-good platform state, anchoring full-disk encryption and secure boot.
A failure mode where a control defaults to denying access when it loses power or malfunctions, protecting the asset; contrast fail safe, which defaults to protecting people.
Encryption where one shared secret key both encrypts and decrypts: fast enough for bulk data, but burdened by the key distribution problem and n(n-1)/2 keys for n parties.
Encryption using linked key pairs where what the public key encrypts only the private key can decrypt; slow, so used for key exchange and signatures rather than bulk data.
A one-way function condensing any input into a fixed-length digest used to verify integrity; computationally infeasible to reverse, and secure only while collisions stay impractical.
A message hash encrypted with the sender's private key, proving integrity, authenticity, and nonrepudiation to anyone with the matching public key; it provides no confidentiality.
The CAs, registration authorities, certificates, and revocation services (CRLs, OCSP) that bind identities to public keys and let strangers trust asymmetric cryptography at scale.
Holding copies of cryptographic keys with a trusted third party so they can be recovered for continuity or produced for lawful access, trading confidentiality risk for availability.
An attack recovering secrets from an implementation's physical leakage (timing, power draw, emanations, cache behaviour) rather than from any weakness in the algorithm itself.
An attack where the adversary secretly relays, and can alter, traffic between two parties who believe they communicate directly; defeated by mutual authentication and certificate validation.
A Clark-Wilson concept: data may only be changed by vetted procedures that move it from one consistent state to another, never by direct edits, preserving internal and external consistency.
A line on a data flow diagram where the level of trust changes, such as between the public internet and an internal network, and a crossing worth examining first.
A picture of a system's components, the data moving between them and its trust boundaries, used as the surface a threat model is walked across element by element.
A security model granting no implicit trust from network location: every request is authenticated, authorised, and continuously verified, wherever it originates.
Reading is half of it. Scenario questions in this domain tend to turn on the distinctions above, and the quickest way to find out which ones you hold is to answer some. The CISSP practice tests cover all eight domains with an explanation for every answer, and the free assessment gives you a baseline first.