Instructor  Andrew Miller soc1024@illinois.edu  

TA  Sanket Kanjalkar  
Location  ECEB 2013  
Lecture Times 
Tuesday and Thursday, 11:00am 12:20pm 

Office  Andrew: CSL 461  Sanket: ECEB 3015 
Office Hours 
Andrew: Thursday 12:301:30pm  Sanket: Wednesday 1:00pm2:00pm 
Piazza  [piazza link] 
Cryptographic protocols are fundamental techniques for building secure systems, even against powerful attackers. Traditionally, cryptography is concerned with communication channels that lets Alice and Bob send messages, (e.g., “Let’s meet by the bridge at 5pm!”) while preventing an eavesdropper Eve from observing the message or tampering with the contents. Cryptography is already widely deployed, for example the TLS protocol is used every time you visit your bank’s website and see a green “padlock” symbol in your browser. Cryptography can also be used for much more than just secure channels. An emerging trend is the use of “computation over encrypted data.” For example, how can we perform a query over encrypted database?
The goal of this course is to introduce the concepts of modern cryptography, including a combination of both theoretical foundations (how do we precisely state security guarantees and assumptions, and prove that a protocol is designed correctly?) and practical techniques. At the end of this course, you will know how to apply cryptographic techniques in the design and analysis of secure distributed systems. This course is intended for senior undergraduate students with an interest in applying cryptographic techniques to building secure systems, and for graduate students with an interest in cryptography or systems security.
Main themes of the course include: Provable security. This course will introduce the modern theory of cryptography, where we provide rigorous proofs that a protocol is secure in spite of interference from arbitrary malicious adversaries (assuming preciselystated models of network primitives and computationallyhard problems). Protocols for secure computing. Traditionally, the goal of cryptography is to build a secure communication channel between Alice and Bob. However, recently, the toolbox of practical cryptographic protocols has become much more versatile and powerful. This course will focus on the application and analysis of protocols for diverse applications, such as secure outsourcing of storage and computing over encrypted data. Failures and limitations of cryptography. Many (if not the vast majority of) deployed cryptosystems have been plagued with vulnerabilities, stemming from ad hoc protocol design, incorrect implementations, and overlysimplistic security models. This course will cover many examples of highprofile attacks.
Prerequisites:
Week 1: Introduction  

Tuesday, Aug 27  Course introduction, syllabus 
(slides) 
Thursday, Aug 29  Cryptography for laypeople, journalists, and cypherpunks 
(slides) Reading (for next time): Pages 1322 (Section 1.1 and Section 1.2) of Pass and Shelat. 
Week 2:  
Tuesday, Sep 3  Group Theory 
Lecture notes: (pdf) Groups programming handout (gitlab) Notes: Appendix C.1 of Goldwasser and Bellare Equivalence Relations [from CS 173] (Section 6.5,6.6) 
Thursday, Sep 5  Interactive Proofs 
Reading: Pass & Shelat, 3.1. Computational Indistinguishability, 4.3 ZeroKnowledge Interactions, 4.4 Interactive Protocols, 4.6 ZeroKnowledge Proofs 
Week 3:  
Sep 10  More Interactive Proofs 
Preview of MP1 (add drop deadline) Optional complementary notes: [Notes from Susan Hohenberger] [Notes from Ivan Damgard] 
Sep 12  More interactive proofs 
MP1 Release (gitlab) Lectures notes (pdf) 
Week 4:  
Sep 17  Composing interactive Proofs  
Sep 19  Noninteractive proofsOne Way Functions 
Notes on Forking Lemma from Bellare [pdf] "How Not To Prove Yourself" [eprint] 
Week 5:  
Sep 24  One Way Functions 
Crypto egg public keys must be posted in Piazza by 11:59pm Notes: Pass & Shelat, 2.2 OneWay Functions, 3.4 HardCore Bits from Any OWF 
Sep 26  Symmetric Encryption and Garbled Circuits 
Notes: Sections 3.5, 3.6, 3.7, 3.9 from Pass and Shelat, also Section 1.3 Notes: Section 6.2 in Pass and Shelat 
Week 6:  
Oct 1  Diffie Hellman problems  **MP1 due** 
Oct 3  Oblivious Transfer  The Simplest OT[eprint] 
Week 7:  
Oct 8  Improving Garbled Circuits 
Notes from Sanjam Garg on cutandchoose for garbled circuits (pdf) Michael Rosulek on history of performance improvements to Garbled Circuits (video,slides) 
Oct 10  Public Key Encryption  Pass and Shelat, 2.9 RSA Collection, 3.10 Public Key Encryption, 3.11 ElGamal Public Key Encryption scheme More notes on Chinese Remainder Theorem (notes) MP2 tentative due Release Midterm 
Week 8:  
Oct 15  Faults and Side channels  Project Ideas day 
Oct 17  Polynomial Interpolation and secret sharing 
Shamirs Secret Sharing Scheme (SSS) [website] 
Week 9:  
Oct 22  Multiparty computation, Beaver Triples  
Oct 24  More MPC, begin Oblivious RAM  
Week 10:  
Oct 29  Cryptocurrencies and Privacy  
Oct 31  Lattice Cryptography and Cryptanalysis  
Week 11:  
Nov 5  Lattice Cryptanalysis  MP4 Released Using LLLReduction for Solving RSA and Factorization Problems: A Survey 
Nov 7  Broadcast Protocols and BFT  
Week 12:  
Nov 12  Passwords 
Reading:  Rainbow tables (pdf)  Let's talk about PAKE (passwordbased authenticated key exchange) (Matt Green's blog) 
Nov 14  
Week 13:  
Nov 18  Bilinear Groups, Threshold Signatures  
Nov 20  Succinct ZeroKnowledge Proofs (zkSNARKs)  
FALL BREAK NOV 23–DEC 1  
Week 14:  
Dec 3  Postquantum Cryptography  
Dec 5  Searchable Encryption  
Week 15:  
Dec 10  Informal project feedback  
Finals Week: Dec 13+  
Exam Period: TBD Final Project presentations 
A proposal for each final project must be submitted to and accepted by the instructor by the proposal deadline.