CSS.304.1 Cryptography



  • 2021 Autumn/Monsoon (Aug - Dec)

Description: This course will be a graduate-level introduction to the theoretical foundations of cryptography. A tentative list of topics include:

  •  One-way functions and permutations.
  •  Hardness Amplification.
  •  Hardcore predicate.
  •  Computational Indistinguishability.
  •  Pseudorandom Generators (PRGs).
  •  Pseudorandom Functions from PRGs.
  •  Collision-Resistant Hash Functions.
  •  Digital Signatures.
  •  Public-Key Encryption and Cryptographic Hardness Assumptions.
  •  Zero-Knowledge proofs (Interactive and Non-Interactive versions).
  •  CCA-Security for PKE.
  •  Oblivious Transfer and Garbled Circuits.
  •  Secure Multiparty Computation.
  •  Special Topics: Fully Homomorphic Encryption and Obfuscation.

References:There is no prescribed textbook, but the following resources would be useful.

1. Foundations of Cryptography: Volume-1 (Basic Tools) by Oded Goldreich.
2. Foundations of Cryptography: Volume-2 (Basic Applications) by Oded Goldreich.
3. Introduction to Modern Cryptography: Second Edition by Jonathan Katz and Yehuda Lindell.

Lecture Notes:
1. A Course in Cryptography by Rafael Pass and abhi shelat. (https://www.cs.cornell.edu/courses/cs4830/2010fa/lecnotes.pdf)
2. Foundations of Cryptography by Yehuda Lindell. (http://u.cs.biu.ac.il/~lindell/89-856/complete-89-856.pdf)
3. Modern Cryptography by Abhishek Jain. (https://www.cs.jhu.edu/~abhishek/classes/CS600-642-442-Fall2019/notes.pdf)
4. Advanced Topics in Cryptography by JonathanKatz. (http://www.cs.umd.edu/~jkatz/gradcrypto2/)