Notes for February 3, 1997

  1. Hello
    1. Homework grades will be mailed out tomorrow; take more care with your programs, as they often did not work as well as you thought.
  2. Puzzle of the day
    1. Key point: notice the size of the shell and of in.telnetd. If these are the same, the attacker left a back door to return through.
  3. ACLs
    1. Review description
    2. Show 2 UNIX implementations (AIX and UNICOS)
    3. Discuss revocation issue
  4. Operating systems as examples
    1. Fence registers
    2. Base & bounds registers
    3. Tagged architecture: tags indicate rights over each word. Ex: B6500 family, which also used them to type the words (data, pointers, control words like stack pointers) Also, can tag blocks of 128 words with one tag
    4. Go through how this works for paging, segmentation
  5. Capabilities
    1. File descriptors in UNIX
    2. Like an unforgeable ticket; can use crypto, or can use tags, or can use protected memory space (the latter two more usual on a single system, the first on a networked system)
    3. Show sample C-list
    4. Copy right

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 1/23/97