CS282A & M209A
Foundations of Cryptography

CS and Math Departments
Instructor: Rafail Ostrovsky,
3732D Boelter Hall.
Office hours: By appointment or after class.
Lectures: M,W 2-3:50pm.

Description: This is a graduate course that introduces students to the theory of cryptography, stressing rigorous definitions and proofs of security. Topics include notions of hardness, one-way functions, hard-core bits, pseudo-random generators, pseudo-random functions and pseudo-random permutations, semantic security, public-key and private-key encryption, secret-sharing, message authentication, digital signatures, interactive proofs, zero-knowledge proofs, private information retrieval, collision-resistant hash functions, commitment protocols, key-agreement, contract signing and two-party secure computation with static security.

Lecture Notes
Course Home Page
Contact Info
General Information/Policies
Course Materials