January 15, 2021 Outline

Reading: text, §4.5, 4.7, 5–5.2.1
Due: Homework #1, due January 22; Project selection, due January 22

1. Policy languages

2. 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 178, 2021 at 12:50PM

You can also obtain a PDF version of this.