definitions - Some useful Information Mapping of Turing...

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

View Full Document Right Arrow Icon
Some useful Information Mapping of Turing machine to protection system { All Tape Symbols, States rights { Tape cell subject { Cell s i has A s i has A rights on itself { Cell s k s k has end rights on itself { State p , head at s i s i has p rights on itself { Distinguished right own : s i owns s i +1 for 1 i < k Bell-Lapadula Rules Let L(S) = l s be the security clearance of subject S, and let L(O) = l o be the security classification of object O. For all security classifications l i , i = 0, . .., k – 1, l i < l i+1 . Simple Security Condition , Preliminary Version: S can read O if and only if l o l s and S has discretionary read access to O. *-Property (Star Property), Preliminary Version: S can write O if and only if l s l o and S has discretionary write access to O. Biba Rules Biba’s Model : Strict Integrity Policy (dual of Bell-LaPadula) o s can read o i ( s ) i ( o ) (no read-down) o s can write o i ( o ) i ( s ) (no write-up) o s 1 can execute s 2 i ( s 2 ) i ( s 1 ) Low-Water-Mark Policy o s can write o i ( o ) i ( s ) (prevents writing to higher level) o s reads o i’ ( s ) = min ( i ( s ), i ( o )) (drops subject’s level) o s 1 can execute s 2 i ( s 2 ) i ( s 1 ) (prevents executing higher level objects) Chinese Wall Rules
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

definitions - Some useful Information Mapping of Turing...

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

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