Outline for April 13, 2000
- Greetings and felicitations!
- Web site up and running
- Homeworks back via UCDisk
- Policy
- Define security policy, secure system, breach of security formally
- Security models
- Confidentiality, integrity policies; distinguish from military, commercial policies
- Role of trust in modeling
- DAC vs. MAC
- Policy languages: high level, low level
- Lattice models
- poset, <= the relation
- highest and lowest
- Set of classes SC is a partially ordered set under relation <=
with GLB (greatest lower bound), LUB (least upper bound) operators
- Note: is reflexive, transitive, antisymmetric
- 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'))
- Bell-LaPadula Model
- Go through security levels, categories, compartments
- Describe simple security property (no reads up) and *-property (no writes down)
- State Basic Security Theorem:
if it's secure and transformations follow these rules, it's still secure
- 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
Page last modified on 6/5/2000