January 14, 2022 Outline

Reading: text, §4.5–4.7
Due: Homework #1, due January 19; Project Selection, due January 21

Module 15

1. Example of applying take-grant rules; clarification of homework problem 3

Module 13

2. Policy and models
3. Policy vs. mechanism

Module 14

4. Policy languages

Module 16

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 13, 2022 at 10:34PM

You can also obtain a PDF version of this.