CS150 Notes 31 (4 November 2005)

Upcoming Schedule

• Friday, 4 November (10:59am): Problem Set 8 team requests
• Monday, 7 November (class): Problem Set 7
• Tuesday, 8 November (11:59pm): Problem Set 8 project descriptions (note: extended one day from PS8 handout)
• Monday, 14 November: Exam 2 (out Friday 11 November)
• Monday, 5 December: Problem Set 8 Presentations/Final Reports

Ways to authenticate:

• Something you know (password)
• Something you have (transparency)
• Something you are (fingerprint)

Cryptographic Hash Functions

One-way: Given h, it is hard to find x such that H(x) = h.
Collision Resistent: Given x, it is hard to find y not equal to x such that H(y) = H(x).

• Passwords: The Weakest Link?, cNet News, 22 May 2002.
  
• Dos and Don'ts of Client Authentication on the Web, Kevin Fu, Emil Sit, Kendra Smith, Nick Feamster. USENIX Security Symposium, 2001.

  by Kristina Caudle

  CS 150: Computer Science University of Virginia

  evans@cs.virginia.edu Using these Materials