Outline for May 22, 2006

Reading: text, §17.3.3—17.3.2.1

1. Greetings and felicitations!
   1. Office hours today from 2:00PM to 3:00PM
2. Information flow analysis
   1. Exceptions and synchronization/IPC operations
   2. Identifying flows in the kernel
   3. Finding relevant variables
   4. Analysis
   5. Example: Secure Xenix
3. Covert flow trees
   1. What it is
   2. Node types
   3. Example for construction
   4. Construction
      1. Determine what attributes primitive operations reference, modify, return
      2. Locate covert storage channel that uses some attribute
      3. Construct lists: sequences of operations that modify, recognize modifications
   5. Analysis
4. Analysis
5. Capacity and noninterference
   1. When is bandwidth of covert channel 0?
   2. Noninterference sufficient
   3. Noninterference not necessary
   4. Analysis