April 11, 2025 Outline

Reading: text, §3.5–3.6, 4.1–4.7
Assignments: Homework #1, due April 14; Project selection, due April 16

Module 11 (text, §3.5–3.5.3)

1. Expressive power
   1. Multi-parent create
   2. Simulation

Module 12 (text, §3.5.4)

2. Typed access control model (TAM)

Module 15 (text, §4.7)

3. 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

Module 13 (text, §4.1–4.4)

4. Policy and models
5. Policy vs. mechanism

Module 14 (text, §4.5–4.6)

6. Policy languages

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 April 10, 2025 at 7:40PM

You can also obtain a PDF version of this.