Syllabus:

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 and Universal One-way functions.
*Computational Indistinguishability.
*Pseudorandom Generators (PRGs).
*Pseudorandom Functions from PRGs.
*Collision-Resistant Hash Functions.
*Digital Signatures.
*Public-Key Encryption and Cryptographic Hardness Assumptions.
*CCA-Security for PKE.
*Zero-Knowledge proofs (Interactive and Non-Interactive versions).
*Oblivious Transfer and Garbled Circuits.
*Secure Multiparty Computation.
*Special Topics: Fully Homomorphic Encryption and Obfuscation.

Prerequisites: Basics of discrete probability, algorithms, and computational complexity.

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