{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# quiz10_sol - ≤ ” such that for any a b ∈ L there is a...

This preview shows page 1. Sign up to view the full content.

CIS 4360 Introduction to Computer Security QUIZ 10, Fall 2011 (5 minutes only) – with answers This quiz concerns access control. 1. Complete the sentences. (a) What is an Access Control matrix? Answer. A matrix whose rows are indexed by the subjects s and columns by the objects o , for which the entry in the ( s, o ) cell contains a list of operations that s can perform on o . (b) If the access rights are kept with the subjects then every subject is given a : capability . (c) If the access rights are kept with the objects then every object has an : Access Control List . (d) Defne a lattice ( L, ). Answer: L is a non-empty set with a partial ordering “
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ≤ ” such that for any a, b ∈ L there is a least upper bound (lub) for a, b in L and a greatest lower bound (glb). (e) Let H = { , 1 , 2 , 3 } , with the natural order “ ≤ ”. Let C be the set oF subsets oF C = { a, b, c } . Consider the set oF L oF all pairs ( h, X ) where X is a subset oF C . i. How many elements does L have? Answer: 2 3 × 4 = 32 ii. Defne an ordering “ ≤ ” on L which makes it into a lattice. ( h, X ) ≤ ( h , X ) iF: Answer: and only if h ≤ h and X ⊆ X . Mike Burmester...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online