January 19, 2023 Outline

Reading: text, §4.1–4.7
Due: Homework #1, due January 24; Project Selection, due January 26

1. Policy and models
2. Policy vs. mechanism
3. Policy languages
4. 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 17, 2023 at 1:47PM

You can also obtain a PDF version of this.