February 21, 2024 Outline

Reading: text, §9.1–9.2
Due: Homework #3, due February 21; Extra Credit #D, due February 23

Module 34 (Policy Composition)

1. Problem with instantiation of Bell-LaPadula Model
   1. Covert channel example: what is “writing”?
   2. Composition of lattices
   3. Principles of autonomy and security

Module 35 (Introduction to Noninterference)

2. Deterministic noninterference
   1. Model of system
   2. Example
   3. Relationship of output to states
   4. Projections and purge functions

Module 36 (Security Policy and the Unwinding Theorem)

3. Alternative definition of security policy
   1. Output-consistent
   2. Security policy
   3. Noninterference-secure with respect to the policy r

4. Unwinding Theorem
   1. Locally respects
   2. Transition-consistent
   3. Unwinding theorem

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 February 22, 2024 at 10:55PM

You can also obtain a PDF version of this.