January 19, 2024 Outline

Reading: text, §3.4–3.6, 4.7
Due: Homework #1, due January 19; Project selection, due January 26

Module 10 (Reading: text, §3.4)

1. Schematic Protection Model
   1. Protection type, ticket, function, link predicate, filter function
   2. Take-Grant as an instance of SPM
   3. Create rules and attenuation
   4. Definitions
   5. path^h predicate
   6. Capacity flow function
   7. Maximal state: definition, existence, derivability
2. Acyclic attenuating schemes and decidability

Module 11 (Reading: text, §3.5–3.5.3)

3. Expressive power
   1. SPM and HRU

Module 12 (Reading: text, §3.5.4)

4. Typed access control model (TAM)

Module 15 (Reading: text, §4.7)

5. Secure, precise
   1. Observability postulate
   2. Theorem: for any program p and policy c, there is a secure, precise mechanism m* such that, for all security mechanisms m associated with p and c, m* ≈ m
   3. Theorem: There is no effective procedure that determines a maximally precise, secure mechanism for any policy and program

Matt Bishop Office: 2209 Watershed Sciences Phone: +1 (530) 752-8060 Email: mabishop@ucdavis.edu

ECS 235B, Foundations of Computer and Information Security Version of January 20, 2024 at 10:57PM

You can also obtain a PDF version of this.