Instructor: Lenore Zuck
hours: M 4-5 or by appointment
M 5-7pm, WWH 101
The class will be run as a combination of lectures
and research seminar. It will focus on two areas:
As there will be no textbook, students should attend
practically every class. Course work will entail reading papers. There
will be exams and/or reports on the papers you read. There will be no programming
Cryptographic foundations of various security protocols.
This will include explaining the mathematical results that are used, with
proofs kept to the barest minimum. The cryptographic algorithms and protocols
covered will mostly be selected from the list: key exchange, authentication,
secret sharing, digital signatures, timestamping services, subliminal channels,
undeniable signatures, bit commitment, coin flipping on the telephone,
all or nothing disclosure of secrets, zero knowledge proofs, digital certified
mail, elections, digital cash, DES, RSA, key management, compromised key
Selected papers/research directions of current interest,
some covered by outside security experts and researchers.
Prerequisites: Fundamental Algorithms (preferably
with an A- or better), Distributed Computing coursework or practical experience.
is no textbook that covers all the material of the course.
A list of recommended books can be accessed by
Introduction to Internet and Internet
Security (2-3 lectures)
Mathematical Preliminaries (1 lecture)
Public-Key Cryptography (3-4 lectures)
Other Cryptosystems (1-2 lectures)
Key Establishment and Management
Authentication Protocols (3 lectures)
Zero-Knowldege Proofs (1 lecture)
Other Secutiry Issues (as time permits)
the "books" link below. Reserved copies will
set aside in the library.
Lecture notes, suggested reading, and links to relevant
papers will be posted on this page.
Final grade will
be based on:
Exams or Final project