Questions?

More documents

Recommendations

Info

CONTEXT FORMALIZATION CHANNELS, FLOWS AND LABELS WRAP-UP Security Labels Security labels: confidentiality and/or integrity levels form a preorder (reflexive and transitive relation) (L, ≤) Security lattice: labels may form a lattice preorder with unique least upper-bound (aka lub or join) and greatest lower-bound (aka glb or meet) for any 2 labels (L, ≤, ⊔, ⊓) lub: ∀l1l2. li ≤ (l1 ⊔ l2) and ∀l3. li ≤ l3 ≤ (l1 ⊔ l2) ⇒ l3 = (l1 ⊔ l2) glb: ∀l1l2. (l1 ⊔ l2) ≤ li and ∀l3. (l1 ⊓ l2) ≤ l3 ≤ li ⇒ l3 = (l1 ⊓ l2) top: ∀l. l ≤ ⊤ bottom: ∀l. ⊥ ≤ l G. Le Guernic DD2460 (III, L1): Information Flow Security 24/35
CONTEXT FORMALIZATION CHANNELS, FLOWS AND LABELS WRAP-UP Security Labels: examples (1) Alice’s secret Top secret Public Bob’s secret Confidentiality A = Alice’s secret ⊥ = Public A ⊔ ⊥ = A Trusted by Alice Fully trusted Untrusted Integrity A = Trusted by Alice B = Trusted by Bob A ⊓ B = Untrusted Trusted by Bob G. Le Guernic DD2460 (III, L1): Information Flow Security 25/35
Page 1 and 2: Information Flow Security DD2460 So
Page 3 and 4: CONTEXT FORMALIZATION CHANNELS, FLO
Page 23: CONTEXT FORMALIZATION CHANNELS, FLO
Page 35: CONTEXT FORMALIZATION CHANNELS, FLO

Questions?

Create successful ePaper yourself

Delete template?

Save as template?