Outline for May 19, 2006

Reading: text, §17.3—17.3.1.2

1. Greetings and felicitations!
2. Covert channels
   1. Storage vs. timing
   2. Noise vs. noiseless
   3. Existence
   4. Bandwidth
3. Covert channel detection
   1. Noninterference
   2. Shared Resource Matrix Model
   3. Information flow analysis
   4. Covert flow trees
4. Noninterference
   1. Version of the Unwinding Theorem
   2. Specifications of SAT
      1. object_create
      2. can_read
      3. readable
   3. Example analysis for SAT
5. Shared resource matrix methodology
   1. Identify shared resources, attributes
   2. Operations accessing those attributes
   3. Building the matrix
      1. Covert storage channels
      2. Covert timing channels
   4. Issues about the methodology