Outline for April 22, 2003

  1. Policy
    1. Policy languages: high level, low level
  2. Bell-LaPadula Model (security classifications only)
    1. Go through security clearance, classification
    2. Describe simple security condition (no reads up), *-property (no writes down), discretionary security property
    3. State Basic Security Theorem: if it's secure and transformations follow these rules, it's still secure
  3. Bell-LaPadula Model (security levels)
    1. Go through security clearance, categories, levels
  4. Lattice models
    1. Poset, ≤ the relation
    2. Reflexive, antisymmetric, transitive
    3. Greatest lower bound, least upper bound
    4. Example with complex numbers

This document is also available in Postscript and PDF.