January 19, 2022 Outline

Reading: text, §A, 5–5.2
Due: Homework #1, due January 19; Project Selection, due January 21


Module 17

  1. Lattices
    1. Poset with ≤ relation reflexive, antisymmetric, transitive; greatest lower bound, least upper bound
    2. Examples

Module 18

  1. Bell-LaPadula Model: intuitive, security classifications only
    1. Level, categories, define clearance and classification
    2. Simple security condition (no reads up), *-property (no writes down), discretionary security property
    3. Basic Security Theorem: if it is secure and transformations follow these rules, it will remain secure

Module 19

  1. Bell-LaPadula Model: intuitive, now add category sets
    1. Apply lattice
      1. Set of classes SC is a partially ordered set under relation dom with glb (greatest lower bound), lub (least upper bound) operators
      2. Note: dom is reflexive, transitive, antisymmetric
      3. Example: (A, C) dom (A′, C′) iff AA′ and CC′;
        lub((A, C), (A′, C′)) = (max(A, A′), CC′); and
        glb((A, C), A′, C′)) = (min(A, A′), CC′)
    2. Simple security condition (no reads up), *-property (no writes down), discretionary security property
    3. Basic Security Theorem: if it is secure and transformations follow these rules, it will remain secure
  2. Maximum, current security level
  3. Example: Trusted Solaris


UC Davis sigil
Matt Bishop
Office: 2209 Watershed Sciences
Phone: +1 (530) 752-8060
Email: mabishop@ucdavis.edu
ECS 235B, Foundations of Computer and Information Security
Version of January 18, 2022 at 1:59PM

You can also obtain a PDF version of this.

Valid HTML 4.01 Transitional Built with BBEdit Built on a Macintosh