Notes for February 19, 1997

  1. Hello
    1. Turn back midterms. mean was 70.
    2. When HW 2 returned (by Friday, I hope!) I'll also hand out a note saying how you're doing.
  2. Puzzle of the day
    1. Key problem: how do you know it's really the student taking the test? Cameras, keystroke identification, etc.
  3. Malicious logic
    1. Quickly review Trojan horses, viruses, bacteria
    2. Logic Bombs
    3. orms (Schoch and Hupp)
  4. Review trust and TCB
    1. Notion is informal
    2. Assume trusted components called by untrusted programs
  5. Ideal: program to detect malicious logic
    1. Can be shown: not possible to be precise in most general case
    2. Can detect all such programs if willing to accept false positives
    3. Can constrain case enough to locate specific malicious logic
    4. Can use: writing, structural detection (patterns in code), common code analyzers, coding style analyzers, instruction analysis (duplicting OS), dynamic analysis (run it in controlled environment and watch)
  6. Best approach: data, instruction typing
    1. On creation, it's type "data"
    2. Trusted certifier must move it to type "executable"
    3. UNIX idea: executable bit is "certified as executable" and must be set by trusted user (Duff)
  7. Practise: blocking writing to communicate information or do damage
    1. Limit writing (use of MAC if available; show how to arrange system executables)
    2. Isolation
    3. Quarantine

You can also see this document as a Binhex Framemaker version 5 document, Postscript document, or a plain ASCII text document.
Send email to

Department of Computer Science
University of California at Davis
Davis, CA 95616-8562

Page last modified on 2/20/97