Notes for February 5, 1997
-
Hello
-
Homework grades will be mailed back soon; grading programs is taking a
bit longer than we thought
-
No homework; study for exam and/or work on project
-
Puzzle of the day
-
Key point: pornographic pictures or pirated software can be left behind
in a "." directory that the remove won't delete.
-
Capabilities
-
Capability-based addressing: show picture of accessing object
-
Show process limiting access by not inheriting all parent's capabilities
-
Revocation: use of a global descriptor table
-
Lock and Key
-
Associate with each object a lock; associate with each process that
has access to object a key (it's a cross between ACLs and C-Lists)
-
Example: use crypto (Gifford). X object enciphered with key K.
Associate an opener R with X. Then:
OR-Access: K can be recovered with any Di
in a list of n deciphering transformations,
so
R = (E1(K),
E2(K), ...,
En(K)) and any process with access to any of the
Di's can access the file
AND-Access: need all n deciphering functions to get K:
R = E1(E2(...En(K)...))
-
MULTICS ring mechanism
-
MULTICS rings: used for both data and procedures; rights are REWA
-
(b1, b2) access bracket - can access freely;
(b3, b4) call bracket - can call segment through gate;
so if a's access bracket is (32,35) and its call bracket is
(36,39), then assuming permission mode (REWA) allows access, a procedure in:
rings 0-31: can access a, but ring-crossing fault occurs
rings 32-35: can access a, no ring-crossing fault
rings 36-39: can access a, provided a valid gate is used as an entry point
rings 40-63: cannot access a
-
If the procedure is accessing a data segment d,
no call bracket allowed; given the
above, assuming permission mode (REWA) allows access, a procedure in:
rings 0-32: can access d
rings 33-35: can access d, but cannot write to it (W or A)
rings 36-63: cannot access d
-
Mandatory vs. Discretionary;
-
security levels
-
categories
-
Bell-LaPadula Model
-
Simple Security Property: no reads up
-
Star Property: no writes down
-
Discretionary Security Property:
if mandatory controls say it's okay, check discretionary controls.
You can also see this document as a
Binhex Framemaker version 5 document,
Postscript document,
or a
plain ASCII text document.
Send email to
cs153@csif.cs.ucdavis.edu.
Department of Computer Science
University of California at Davis
Davis, CA 95616-8562
Page last modified on 2/8/97