Cryptography is an essential part of computer security but in many contexts
it is treated as a black box with illspecified or highly idealized properties.
For many cryptographic primitives the notions of security have indeed been
formalized satisfactorily using notions from computational complexity and
randomized algorithms. Furthermore, using reductions, researchers have shown
how to develop cryptosystems whose security is precisely based on the
intractibility of computing certain functions.
This course will examine the following questions:
 What does it mean for cryptographic protocols to be secure?
 How can we base secure cryptographic protocols on intractible problems?
 What are some existing cryptographic protocols and how do they
fit in this framework?
In particular we will study:
Work in the class will consist of notetaking (possibly), a small number of
written assignments, and a final project that will involve reading and giving
a presentation of a cryptography paper.
Prerequisite: Some familiarity with formal models of computation will be
helpful


Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA 981952350
(206) 5431695 voice, (206) 5432969 FAX
[comments to Paul Beame]

