Outline for January 27, 2016

Reading: text, § 5 (except 5.2.3–5.2.4), 6.1, [21]
Due: Homework 2, due February 5

1. Clark-Wilson Model
   1. Theme: military model does not provide enough controls for commercial fraud, etc. because it does not cover the right aspects of integrity
   2. Components
      1. Constrained Data Items (CDI) to which the model applies
      2. Unconstrained Data Items (UDIs) to which no integrity checks are applied
      3. Integrity Verification Procedures (IVP) that verify conformance to the integrity spec when IVP is run
      4. Transaction Procedures (TP) takes system from one well-formed state to another
2. Certification and enforcement rules of the Clark-Wilson Model
   1. [C1] All IVPs must ensure that all CDIs are in a valid state when the IVP is run.
   2. [C2] All TPs must be certified to be valid, and each TP is associated with a set of CDIs it is authorized to manipulate.
   3. [E1] The system must maintain these lists and must ensure only those TPs manipulate those CDIs.
   4. [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.
   5. [C3] The list of relations in E2 must be certified to meet the separation of duty requirement.
   6. [E3] The system must authenticate the identity of each user attempting to execute a TP.
   7. [C4] All TPs must be certified to write to an append-only CDI (the log) all information necessary to reconstruct the operation.
   8. [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).
   9. [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
3. Greetings and felicitations!
4. Classical Cryptography
   1. Monoalphabetic (simple substitution): f(a) = a + k mod n
   2. Example: Caesar with k = 3, RENAISSANCE → UHQDLVVDQFH