CS 183 Winter 2007 Schedule and Syllabus

 

Time:

4:00 to 5:50 pm, Monday and Wednesday

 

4:00 to 4:50 pm, Friday (TA Discussion Section)

 

Place:

WGYoung 4216 (Lecture)

 

Botany 325 (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:

Nishanth Chandran (email: <first name> at cs.ucla.edu)

 

Office Hours:

     Tuesday   10:30 to 11:30 am

     Thursday  1 to 2 pm

at Boelter Hall 3714

 

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, 2 midterms and 1 final exam. Homeworks will account for 20% of the grade, the two midterms will account for 20% of the grade each and the final will account for 40%.

 

Textbook:

Lecture notes for the course will be available by January 10th 2007 (Wednesday) morning

 

Midterm/Exam Schedule:

Midterm 1: January 31st 2007, Wednesday; during class hours

 

Midterm 2: February 28th 2007, Wednesday; during class hours

 

Final : March 19th 2007, Monday; 8:00 to 11:00 am