March 5, 2014 Outline

Reading: §17
Assignment due: Homework #4, due March 17, 2014 (no lates!!!)
Project, due March 21, 2014


  1. Covert channels
    1. Storage vs. timing
    2. Noise vs. noiseless
    3. Existence
    4. Bandwidth
  2. Covert channel detection
    1. Shared Resource Matrix Model
    2. Information flow analysis
    3. Covert ▀ow trees
  3. Shared resource matrix methodology
    1. Identify shared resources, attributes
    2. Operations accessing those attributes
    3. Building the matrix
    4. Issues about the methodology
  4. Capacity
    1. When is bandwidth of covert channel 0?
    2. Analysis
    3. Measuring capacity
  5. Mitigating covert channels
    1. Preallocation and hold until process terminates
    2. Impose uniformity
    3. Randomize resource allocation
    4. Efficiency/performance vs. security

You can also obtain a PDF version of this. Version of March 5, 2014 at 7:46PM