30 - Chapter 30: Lattices Overview Definitions Lattices...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #30-1 Chapter 30: Lattices Overview Definitions Lattices Examples
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #30-2 Overview Lattices used to analyze Bell-LaPadula, Biba constructions Consists of a set and a relation Relation must partially order set Partial ordering < orders some, but not all, elements of set
Background image of page 2
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #30-3 Sets and Relations S set, R : S × S relation If a , b S , and ( a , b ) R , write aRb Example I = { 1, 2, 3}; R is R = { (1, 1), (1, 2), (1, 3), (2, 2), (2, 3), (3, 3) } So we write 1 2 and 3 3 but not 3 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
June 1, 2004 Computer Security: Art and Science ©2002-2004 Matt Bishop Slide #30-4 Relation Properties Reflexive For all a S , aRa On I , is reflexive as 1 1, 2 2, 3 3 Antisymmetric
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 13

30 - Chapter 30: Lattices Overview Definitions Lattices...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online