CS 290G: Introduction to Modern Cryptography (Winter 2016)
Instructor: Stefano Tessaro, tessaro(at)cs(dot)ucsb(dot)edu
Class time and location: TR 34:50pm (Phelps 2510)
Office hours: T 56pm or by appointment (HFH 1117)
Class webpage: http://www.cs.ucsb.edu/~tessaro/cs290/
Piazza: We will be using Piazza for classrelated discussions. The Piazza page will be set up soon.
Announcements
 [Jan 5, 2016]: Ready to go, some important updates to assessment and added Piazza links.
 [Dec 17, 2015]: Home page set up. Please check regularly for updates (there will be some!)
Course Description
Cryptography provides the basic technology to protect information and to communicate securely. This class is a selfcontained graduatelevel introduction to modern cryptography. We will study tools and techniques to design systems with provable security guarantees.
A main highlevel objective of the class is to learn how security of cryptographic algorithms is properly defined, and to understand security proofs and what type of guarantees they provide.
Required background: Even though the material has direct practical applications, the class will take a rigorous approach: Exposure to undergraduatelevel basics of probability, algebra / elementary number theory (modular arithmetic) and complexity theory (in particular, to reductions) is expected, as well as a certain level of mathematical maturity (students should be ready to understand mathematical proofs, and to write simple ones). If in doubt, contact the instructor! Extension students: If you are visiting UCSB and want to attend this class, you need permission from me  get in touch with me and be ready to give copy of your transcripts to make sure you have the appropriate background.
Assessment (tentative): Final assessment will depend on a combination of homework (there will be four problem sets, accounting overall to 1/2 of the grade), a takehome final (accounting to 30% of the grade), and a small project (20%). Homework and project can be solved in pairs, but you should be able to demonstrated individual contribution. More specific information is available on the class slides.
Textbook: No textbook will be required, but the following are great resources to support the class (most of them are available for download):
 J. Katz and Y. Lindell. Introduction to Modern Cryptography
 D. Boneh and V. Shoup. A Graduate Course in Applied Cryptography
 M. Bellare and P. Rogaway. Introduction to Modern Cryptography (Lecture Notes)
 R. Pass and a. shelat. A Course in Cryptography
 O. Goldreich. Foundations of Cryptography
Schedule
The following is a tentative schedule, and is intended to give a rough idea about what I hope to cover in the class and in which order. There will be (slight) changes depending on the pace of the class.
Week  Date  Lecture contents  Reading material / Slides  Assignments 

1  20160105 
Welcome to CS290G
 
20160107 
Computational Hardness
 
2  20160112  Class is canceled (TCC '16)  
20160114 
Pseudorandomness I
 
3  20160119 
Pseudorandomness II
 
20160121  Pseudorandomness III
 
4  20160126  Pseudorandomness IV
 
20160128  Symmetric Encryption
 
5  20160202  Message Authentication
 
20160204  Authenticated Encryption
 
6  20160209  Publickey Encryption I
 
20160211  Publickey Encryption II
 
7  20160216 
CCA Security I
 
20160218  CCA Security II
 
8  20160223  Digital Signatures
 
20160225  Identitybased encryption
 
9  20160301  LatticeBased Cryptography
 
20160303  FullyHomomorphic Encryption
 
10  20160308  Cryptographic Protocols I
 
20160310  Cryptographic Protocols II
