January 23, 2019 Outline

Reading: text, §5.1–5.3
Due: Homework 1, due January 23

  1. Bell-LaPadula Model: intuitive, security classifications only
    1. Lattice: poset with ≤ relation reflexive, antisymmetric, transitive; greatest lower bound, least upper bound
    2. 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′)
    3. Simple security condition (no reads up), *-property (no writes down), discretionary security property
    4. Basic Security Theorem: if it is secure and transformations follow these rules, it will remain secure
    5. Maximum, current security level

UC Davis seal
Matt Bishop
Office: 2209 Watershed Science
Phone: +1 (530) 752-8060
Email: mabishop@ucdavis.edu
You can also obtain a PDF version of this.
Version of January 25, 2019 at 3:43PM