**Reading:** §3.3

- Conspiracy
- Access set
- Deletion set
- Conspiracy graph
*I*,*T*sets- Theorem: can•steal(α,
**x**,**y**,*G*_{0}) iff there is a path from some*h*(**p**) ∈*I*(**x**) to some*h*(**q**) ∈*T*(**y**)

- Schematic Protection Model
- Protection type, ticket, function, link predicate, filter function
- Take-Grant as an instance of SPM
- Create rules and attenuation

- Safety analysis
- Definitions
*path*predicate^{h}- Capacity flow function
- Maximal state: definition, existence, derivability

- Acyclic attenuating schemes and decidability
- Expressive power
- SPM and HRU
- ESPM and multiparent create
- Simulation and expressiveness

A PDF version is available here.

ECS 235B, Foundations of Computer and Information Security Winter Quarter 2012 |