March 5, 2014 Outline
Reading:
§17
Assignment due:
Homework #4, due March 17, 2014 (
no lates!!!
)
Project, due March 21, 2014
Covert channels
Storage vs. timing
Noise vs. noiseless
Existence
Bandwidth
Covert channel detection
Shared Resource Matrix Model
Information flow analysis
Covert ßow trees
Shared resource matrix methodology
Identify shared resources, attributes
Operations accessing those attributes
Building the matrix
Issues about the methodology
Capacity
When is bandwidth of covert channel 0?
Analysis
Measuring capacity
Mitigating covert channels
Preallocation and hold until process terminates
Impose uniformity
Randomize resource allocation
Efficiency/performance vs. security
You can also obtain a PDF version of this.
Version of March 5, 2014 at 7:46PM