January 23, 2019 Outline
Reading
:
text
, §5.1–5.3
Due
: Homework 1, due January 23
Bell-LaPadula Model: intuitive, security classifications only
Lattice: poset with ≤ relation reflexive, antisymmetric, transitive; greatest lower bound, least upper bound
Apply lattice
Set of classes
SC
is a partially ordered set under relation
dom
with
glb
(greatest lower bound),
lub
(least upper bound) operators
Note:
dom
is reflexive, transitive, antisymmetric
Example: (
A
,
C
)
dom
(
A
′,
C
′) iff
A
≤
A
′ and
C
⊆
C
′;
lub
((
A
,
C
), (
A
′,
C
′)) = (
max
(
A
,
A
′),
C
∪
C
′; and
glb
((
A
,
C
), (
A
′,
C
′)) = (
min
(
A
,
A
′),
C
∩
C
′)
Simple security condition (no reads up), *-property (no writes down), discretionary security property
Basic Security Theorem: if it is secure and transformations follow these rules, it will remain secure
Maximum, current security level
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 25, 2019 at 3:43PM