Outline for February 29, 2012

Reading: §14.6, 16.1–16.2

  1. Identity
    1. State and cookies
    2. Anonymity (remailers, onion routing)
  2. Information flow
  3. Entropy
    1. Random variables
    2. Joint probability
    3. Conditional probability
    4. Entropy (or uncertainty in bits)
    5. Joint entropy
    6. Conditional entropy
  4. Entropy-based analysis
    1. Flow of information from x to y
    2. Implicit flow of information
  5. Non-lattice policies
    1. Transitivity
    2. Information flow policy
    3. Confinement flow model
  6. Transitive non-lattice policies
    1. Quasi-ordered sets
  7. Non-transitive policies
    1. Dual mappings
    2. Theorem: a dual mapping from a reflexive information flow policy into an ordered set is order-preserving
A PDF version is available here.
UC Davis sigil
ECS 235B, Foundations of Computer and Information Security
Winter Quarter 2012