Time:

2:00 to 3:50 pm, Monday and Wednesday

2:00 to 3:30 pm, Friday (TA Discussion Section)

Place:

Boelter Hall 5420 (Lecture)

Boelter Hall 5252 (TA Discussion Section)

Instructor:

Prof. Rafail Ostrovsky (email: <first name> at cs.ucla.edu)

Office Hours: Tuesday 4:00 to 5:00 pm at Boelter Hall 3732D

TA:

Abhishek Jain (email: <first name> at cs.ucla.edu)

Syllabus:

1. Notions of hardness

2. One-way functions

3. Hard-core bits

4. Pseudorandom generators, pseudorandom functions and pseudorandom permutations

5. Semantic security

6. Public-key and private-key encryption

7. Key-agreement

8. Homomorphic encryption

9. Private information retrieval and voting protocols

10. Message authentication and digital signatures

11. Interactive proofs and zero-knowledge proofs

12. Collision-resistant hash functions

13. Commitment protocols

14. Two-party secure computation with static security

Assignments/Grading:

There will be about 5 Homeworks, one midterm (in class) and one final exam. Homework will account for 20% of the grade, midterm will account for 40% of the grade and final will account for 40%.

Textbook:

Lecture notes for the course are available from:

http://www.cs.ucla.edu/~rafail/PUBLIC/OSTROVSKY-DRAFT-LEC-NOTES-2006.pdf

Warning: lecture notes are from a graduate class, and include advanced material which will not be covered in this class. I will indicate for each lecture which parts are in scope.

(NOTE: I am working on a revised version of lecture notes, which will become available sometime during the class).