Notes for November 19, 1999

1. Greetings and Felicitations!
   1. Program #3 is due today, not yesterday ...
2. Puzzle of the Day
3. Capabilities
   1. Capability-based addressing: show picture of accessing object
   2. Show process limiting access by not inheriting all parent's capabilities
   3. Revocation: use of a global descriptor table
4. Lock and Key
   1. 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)
   2. 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 D_i in a list of N deciphering transformations, so
      R = (E₁(K), E₂(K), ..., E_n(K)) and any process with access to any of the D_i's can access the file
      AND-Access: need all n deciphering functions to get K): R = E₁(E₂(...i>E_n(K))...)
5. Bell-LaPadula Model
   1. Simple Security Property: no reads up
   2. Star Property: no writes down
   3. Discretionary Security Property: if mandatory controls say it's okay, check discretionary controls.
   4. Basic Security Theorem: A system is secure if its initial state is secure and no action violates the above rules.
6. Lattice Model
   1. Set of classes SC is a partially ordered set under relation DOM; with GLB (CIPLUS), LUB (CITIMES)
   2. Note: DOM is reflexive, transitive, antisymmetric
   3. Application to MLS: forms a lattice with elements being the Cartesian product of the linear lattice of levels and the subset lattics of categories
   4. Examples: (A, C) DOM (A', C') iff A <= A' and C SUBSET C';
      (A, C) CITIMES (A', C") = (max(A, A'), C UNION C')
      (A, C) CIPLUS (A', C') = (min(A, A'), C INTERSECT C')
7. Biba: mathematical dual of BLP
   1. P may read O if L(P) <= L(O) and C(P) SUBSET C(O)
   2. P may write O if L(O) <= L(P) and C(O) SUBSET C(P)
   3. Combined with BLP: continue example
8. Clark-Wilson
   1. Theme: military model does not provide enough controls for commercial fraud, etc. because it does not cover the right aspects of integrity
   2. Data items: "Constrained Data Items" (CDI) to which the model applies, "Unconstrained Data Items (UDIs) to which no integrity checks are applied, "Integrity Verification Procedures" (IVP) that verify conformance to the integrity spec when IVP is run, "Transaction Procedures" (TP) takes system from one well-formed state to another
   3. Certification and enforcement rules:
      C1. All IVPs must ensure that all CDIs are in a valid state when the IVP is run
      C2. All TPs must be certified to be valid, and each TP is assocated with a set of CDIs it is authorized to manipulate
      E1. The system must maintain these lists and must ensure only those TPs manipulate those CDIs
      E2. The system must maintain a list of User IDs, TP, and CDIs that that TP can manipulate on behalf of that user, and must ensure only those executions are performed.
      C3. The list of relations in E2 must be certified to meet the separation of duty requirement.
      E3. The sysem must authenticate the identity of each user attempting to execute a TP.
      C4. All TPs must be certified to write to an append-only CDI (the log) all information necessary to resonstruct the operation.
      C5. Any TP taking a UDI as an input must be certified to perform only valid transformations, else no transformations, for any possible value of the UDI. The transformation should take the input from a UDI to a CDI, or the UDI is rejected (typically, for edits as the keyboard is a UDI).
      E4. Only the agent permitted to certify entities may change the list of such entities associated with a TP. An agent that can certify an entity may not have any execute rights with respect to that entity.