Cryptography allows us to achieve secure and private communication and computation in insecure environments. We will study various settings of interest in which these seemingly impossible objectives can be achieved (and some where they cannot). This year's version will attempt to address the gap between the theory and practice of cryptography.
|Secret sharing and perfectly secure encryption||pdf ✎|
|Pseudorandomness and private-key encryption||pdf ✎|
|Pseudorandom functions and chosen plaintext attacks||pdf ✎|
|Public-key encryption, obfuscation, DDH and LWE||pdf ✎|
|Identification schemes||pdf ✎|
|Authentication, signatures, hashing, random oracles||pdf ✎|
|Two-party computation, oblivious transfer, garbled circuits||pdf ✎|
|Oct 26||Chung Yeung festival|
|Commitments, zero-knowledge||pdf ✎|
|Proofs of knowledge, fairness, multiparty computation||pdf ✎|
|Homomorphic encryption, impossibility of obfuscation||pdf ✎|
|Succinct proofs||pdf ✎|
|Quantum computing and cryptography||pdf ✎|
Notes will be provided for every lecture. The following references cover some of the topics in more detail.