January 11, 2019 Outline
Reading
:
text
, § 3.3–3.4
Due
: Homework #1, due January 23
can•steal
(
r
,
x
,
y
,
G
_{0}
) definition and theorem
Conspiracy
What is of interest?
Access, deletion sets
Conspiracy graph
Number of conspirators
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
^{h}
predicate
Capacity flow function
Maximal state: definition, existence, derivability
Matt Bishop
Office: 2209 Watershed Science
Phone: +1 (530) 752-8060
Email:
mabishop@ucdavis.edu
You can also obtain a PDF version of this.
Version of January 11, 2019 at 2:23PM