Outline for January 27, 2006

Reading: text, §23.3–23.4

1. Greetings and felicitations!
   1. Puzzle of the day
2. Vulnerability Models
   1. PA model
   2. RISOS
   3. NRL
   4. Aslam
3. Example Flaws
   1. fingerd buffer overflow
   2. xterm race condition
4. RISOS
   1. Goal: Aid managers, others in understanding security issues in OSes, and work required to make them more secure
   2. Incomplete parameter validation—failing to check that a parameter used as an array index is in the range of the array;
   3. Inconsistent parameter validation—if a routine allowing shared access to files accepts blanks in a file name, but no other file manipulation routine (such as a routine to revoke shared access) will accept them;
   4. Implicit sharing of privileged/confidential data—sending information by modulating the load average of the system;
   5. Asynchronous validation/Inadequate serialization—checking a file for access permission and opening it non-atomically, thereby allowing another process to change the binding of the name to the data between the check and the open;
   6. Inadequate identification/authentication/authorization—running a system program identified only by name, and having a different program with the same name executed;
   7. Violable prohibition/limit—being able to manipulate data outside one's protection domain; and
   8. Exploitable logic error—preventing a program from opening a critical file, causing the program to execute an error routine that gives the user unauthorized rights.
5. PA Model (Neumann's organization)
   1. Goal: develop techniques to search for vulnerabilites that less experienced people could use
   2. Improper protection (initialization and enforcement)
      1. Improper choice of initial protection domain—incorrect initial assignment of security or integrity level at system initialization or generation; a security critical function manipulating critical data directly accessible to the user;
      2. Improper isolation of implementation detail—allowing users to bypass operating system controls and write to absolute input/output addresses; direct manipulation of a hidden data structure such as a directory file being written to as if it were a regular file; drawing inferences from paging activity
      3. Improper change—the time-of-check to time-of-use flaw; changing a parameter unexpectedly;
      4. Improper naming—allowing two different objects to have the same name, resulting in confusion over which is referenced;
      5. Improper deallocation or deletion—leaving old data in memory deallocated by one process and reallocated to another process, enabling the second process to access the information used by the first; failing to end a session properly
   3. Improper validation—not checking critical conditions and parameters, so a process addresses memory not in its memory space by referencing through an out-of-bounds pointer value; allowing type clashes; overflows
   4. Improper synchronization
      1. Improper indivisibility—interrupting atomic operations (e.g. locking); cache inconsistency
      2. Improper sequencing—allowing actions in an incorrect order (e.g. reading during writing)
   5. Improper choice of operand or operation—using unfair scheduling algorithms that block certain processes or users from running; using the wrong function or wrong arguments.
   6. Analysis procedure
      1. Collect descriptions of protection patterns
      2. Convert to raw error patterns
      3. Abstract into system-independent components
      4. Determine which features in the OS code are relevant, and abstract relevant contexts of those features
      5. Compare the combinations of the relevant features in the OS with generic error patterns