February 23, 2022 Outline

Reading: text, §17.1–17.3.2, C
Assignments: Homework 4, due March 9

Module 48

1. Entropy

Module 49

2. Entropy-based analysis
   1. Flow of information from x to y
   2. Implicit flow of information

Module 50

3. Non-lattice policies
   1. Transitivity
   2. Information flow policy
   3. Confinement flow model
4. Transitive non-lattice policies
   1. Quasi-ordered sets
5. Basic policy composition
6. Non-transitive policies
   1. Dual mappings
   2. Theorem: a dual mapping from a reflexive information flow policy into an ordered set is order-preserving

Module 51

7. Compiler-based flow mechanisms
   1. Scalar declarations
   2. Array declarations
   3. Assignment statements
   4. Compound statements
   5. Conditional statements

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 23, 2022 at 10:54AM

You can also obtain a PDF version of this.