CS655: Advanced Cryptography

(Spring 2023)

Schedule Subject to Change

Readings should be completed before class. Homeworks are due at 11:59PM on Gradescope on the assigned due date. Course Homepage

	Tuesday	Thursday
Week 1 (January 10 & 12)	Overview of the course, Review Symmetric Key Crypto (PRFs, MACs, CCA-Security, CPA-Security, Authenticated Encryption) Slides ppt --->	Random Oracle Model
Week 2 (January 17 & 19)	Multi-User Security of AES-GCM Slides ppt ---> Papers: The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 by Ballare and Tackmann (CRYPTO 2016) Partitioning Oracle Attacks by Len, Grubbs and Ristenpart (USENIX 2021)	AES-GCM-SIV Partitioning Oracle Attacks Papers: Partitioning Oracle Attacks by Len, Grubbs and Ristenpart (USENIX 2021) AES-GCM-SIV: Specification and Analysis by Gueron, Langley and Lindell Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds by Bose, Hoang and Tessaro (EUROCRYPT 2018)
Week 3 (January 24 & 26) Slides ppt	Memory Tight Reductions Slides ppt Homework 1 Released [.tex] Reading: Memory-Tight Reductions, On the Streaming Indistinguishability of a Random Permutation and a Random Function	Memory Tight Reductions Reading: The Memory-Tightness of Authenticated Encryption, Hiding in Plain Sight: Memory-tight Proofs via Randomness Programming
Week 4 (January 31 & February 2) Slides ppt	Pre-Processing Attacks and Lower Bounds Reading: The Discrete-Logarithm Problem with Preprocessing, Random Oracles and Non-Uniformity	Generic Group Model + Pre-Processing Attacks and Lower Bounds Reading: Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
Week 5 (February 7 & 9) Slides ppt	Data-Independent Memory-Hard Functions and Graph Pebbling Reading: High Parallel Complexity Graphs and Memory-Hard Functions, Efficiently Computing Data-Independent Memory-Hard Functions	Pebbling Reductions Reading: Depth-Robust Graphs and Their Cumulative Memory Complexity Homework 2 Released [.tex]
Week 6 (February 14 & 16) Slides ppt	Data-Dependent Memory Hard Functions and Dynamic Pebbling Games High Parallel Complexity Graphs and Memory-Hard Functions, Efficiently Computing Data-Independent Memory-Hard Functions	Bandwidth Hard Functions, Reversible Pebbling
Week 7 (February 21 & 23) Slides ppt	Project Proposal Due (11:59PM by E-mail) Building Depth-Robust Graphs (Wrapup) Sustained Space Complexity	Bandwidth Hard Functions Paper 2 Scrypt is Maximally Memory-Hard Homework 2 Due (11:59PM on Gradescope)
Week 8 (February 28 & March 2) Slides ppt	Scrypt is Maximally Memory-Hard	Midterm (No Class)
Week 9 (March 7 & 9) Slides ppt	Simple Proofs of Sequential Work	Verifiable Delay Functions Simple Verifiable Delay Functions
Week 10 (March 14 & 16) Slides ppt	SPRING BREAK (No Class)	SPRING BREAK (No Class)
Week 11 (March 21 & 23) Slides ppt	How to Use Indistinguishability Obfuscation: Deniable Encryption, and More	Succinct Randomized Encodings and Their Applications Overcoming Cryptographic Impossibility Results using Blockchains Course Project Report Due
Week 12 (March 28 & 30) Slides ppt	Function Secret Sharing Readings: TBD	Function Secret Sharing: Extensions and Improvements Homework 3 [.tex]
Week 13 (April 4 & 6) Slides ppt	Computing Arbitrary Functions of Encrypted Data Fully Homomorphic Encryption over the Integers	TBD []
Week 14 (April 11 & 13) Slides ppt	How to Record Quantum Queries, and Applications to Quantum Indifferentiability Homework 3 Due @ 11:59PM on Gradescope	Quantum Random Oracle Model (Continued) Homework 4 Released [.tex]
Week 15 (April 18 & 20) Slides ppt	TBD	TBD
Week 16 (April 25 & 27) Slides ppt	TBD	Special Topic (TBD)

Final Exam

Date: TBD
Time: TBD
Location: TBD
Important: The last possible date for a final exam is Saturday, May 6. Do not book travel before this date!

Last updated on January 10, 2023.