UCLA  CS 282B/ MATH 209B: Cryptographic Protocols Computer Science Department

Instructor: Prof. Rafail Ostrovsky, Office: 3732D Boelter Hall. Office hours: Tuesday 4-5pm or by appointment. Lectures: M,W 4-5:50pm. (first lecture is on April 4th, 2005) Where: Boelter Hall, 5436 Description: This is the second part of the two-part course sequence on foundations of cryptography. This sequel will consider advanced cryptographic protocol design and analysis. Topics include: non-interactive zero knowledge proofs; zero-knowledge arguments; concurrent and non black-box zero-knowledge; IP=PSPACE proof, stronger notions of security for public-key encryption including chosen-cyphertext security; secure multi-party computation; dealing with dynamic adversary; non-malleability and composability of secure protocols; software protection; threshold cryptography; identity-based cryptography; private information retrieval; protection against man-in-the-middle attacks; voting protocols; identification protocols; digital cash schemes; lower bounds on the use of cryptographic primitives, software obfuscation. May be repeated for credit with topic change. Objectives: This is the second 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 prerequsite course is COM SCI 282A.

Course Home Page Contact Info General Information/Policies Course Materials by Lecture Number