UCLA  CS282A & MATH209A: Foundations of Cryptography Computer Science Department

Instructor: Prof. Rafail Ostrovsky, Office: 3732D Boelter Hall. Office hours: By appointment or after class. Lectures: M,W 4-5: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, collision-resistant hash functions, commitment protocols, key-agreement, contract signing and two-party secure computation with static security. Objectives: This is the first part of a two-part course sequence meant to introduce students to up-to-date research in cryptography, including modern cryptographic definitions and proofs of security. A follow-on course is COM SCI 282B.

Course Home Page Contact Info General Information/Policies Course Materials