# Outline for April 13, 2000

1. Greetings and felicitations!
1. Web site up and running
2. Homeworks back via UCDisk
2. Policy
1. Define security policy, secure system, breach of security formally
2. Security models
3. Confidentiality, integrity policies; distinguish from military, commercial policies
4. Role of trust in modeling
5. DAC vs. MAC
6. Policy languages: high level, low level
3. Lattice models
1. poset, <= the relation
2. highest and lowest
3. Set of classes SC is a partially ordered set under relation <= with GLB (greatest lower bound), LUB (least upper bound) operators
4. Note: is reflexive, transitive, antisymmetric
5. Examples: (A, C) <= (A', C') iff A <= A' and C is a subset of C';
LUB((A, C), (A', C')) = (max(A, A'), UNION(C, C')), GLB((A, C), (A', C')) = (min(A, A'), INTERSECTION(C, C'))
1. Go through security levels, categories, compartments
2. Describe simple security property (no reads up) and *-property (no writes down)
3. State Basic Security Theorem: if it's secure and transformations follow these rules, it's still secure
4. Add in discretionary security policy

Send email to bishop@cs.ucdavis.edu.

Department of Computer Science
University of California at Davis
Davis, CA 95616-8562