March 6, 2024 Outline

Reading: text, §17.1–17.2, 18.1
Due: Homework #5, due March 15; Extra Credit #F, due March 15

Module 48 (Introduction to Information Flow)

1. Entropy-based analysis
   1. Flow of information from x to y
   2. Implicit flow of information

Module 49 (Information Flow Policies)

2. Non-lattice policies
   1. Transitivity
   2. Information flow policy
   3. Confinement flow model

3. Transitive non-lattice policies
   1. Quasi-ordered sets

4. Basic policy composition

5. Non-transitive policies
   1. Dual mappings
   2. Theorem: a dual mapping from a reflexive information flow policy into an ordered set is order-preserving

Module 50 (Confinement Problem)

6. Confinement problem
   1. What it is
   2. Covert channels
   3. Rule of transitive confinement
   4. Difficulty of preventing leaking

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 March 8, 2024 at 2:51PM

You can also obtain a PDF version of this.