Lectures in Cryptography - 2006

• Mar 6: Introduction, One Time Pad, Security Definitions.
• Mar 7: Statistical & Computational Indistinguishability, The Hybrid Argument
• Mar 13: Strong & Weak One Way Functions, Examples, Hard Bit of a One Way Permutation,The Goldreich-Levin Construction (proof sketch).
• Mar 20-21: Proof of the GL Construction.
• Mar 27-28: Pseudo Random Number Generators from any One Way Permutation (OWP), Secure Private and Public Key Encryption, Examples based on DLog, RSA, Rabin.
• Apr 3: Private Modular Sum Protocol, Polynomial Secret Sharing Scheme.
• Passover Break.
• Apr 24-25: Verifiable Secret Sharing Protocol. Private Multiparty Computation (Faulty players follow the protocol but may try to gain additional information).
• May 1-2: No class (Memorial and Independence Day).
• May 8-9: Universal Composability. Secure Function Evaluation Protocol (for less than n/3 faulty players).
• May 15: No class.
• May 16: UC Security Proof for SFE.
• May 22: No Class.
• May 23: Zero Knowledge Proofs. Graph Isomorphism in SZK.
• May 29: Computational Zero Knowledge Proofs for NP (Assuming OWP).
• May 30: Perfect Zero Knowledge Arguments for NP (Assuming Claw Free Function collections + Examples), Witness Indistiguishabilty.
• June 5: Parallel ZK Arguments (the FLS trick), Polylog Efficient ZK Arguments.
• June 6: Oblivious Delivery, 2-Party Secure Computation.
• June 12-13: Secure Digital Signatures.
• June 19-20: Quantum Key Distribution Protocols.
• June 26: Pseudo Random Function Generator and Memoryless Digital Signature Schemes.

• Ran Canetti's MIT lecture notes.
• Goldreich, Foundations of Cryptography, Book II, Chapter 7.