CS 292F: Introduction to Modern Cryptography (Winter 2018)
Instructor: Stefano Tessaro, tessaro(at)cs(dot)ucsb(dot)edu
Class time and location: MW 910:50am (GIRV 2108)
Office hours: T 45pm or by appointment (HFH 1117)
Class webpage: http://www.cs.ucsb.edu/~tessaro/cs292f/
Piazza: We will be using Piazza for classrelated discussions. The Piazza webpage is available at piazza.com/ucsb/winter2018/cs292f/home. Sign up at piazza.com/ucsb/winter2018/cs292f
Announcements
 Initial webpage set up.
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. Tools will include foundations (oneway functions, pseudorandomness), encryption and authentication, secret and publickey cryptography, introduction to cryptographic protocols (multiparty computation, zeroknowledge), latticebased cryptography.
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 (this can be caught up in
part during the class, but get in touch with instructor to assess
gaps), 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!
NonCS majors: You are welcome to attend the class. There will be some room. Just show up the first class, and you will then be added to the class.
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 schedule will grow as we proceed with the class, and list what we covered in class.
Week  Date  Lecture contents  Additional reading material  Assignments 

1  20170117 
Welcome to CS290G
 
2  20170122 
Computational Hardness and oneway functions



20170124  (Computational) Indistinguishability and PRGs




3  20170129 
Pseudorandomness (cont'd)



20170131  PRGs and PRFs




3  20170205 
Pseudorandom functions and permutations



20170207  Introduction to encryption


