6.857: Computer and Network Security

Lectures and Handouts

Lecture 1 (Wednesday, February 5): Introduction

• Course information handout
• Lecture 1 Notes: Introduction

Problem Set 1 (Monday, February 10)

• Problem Set
• tenciphs.txt
• otp-feedback.py
• Plot of English run lengths
• Sample Solutions: 1.1, 1.2, 1.3, and another 1.3

Lecture 2 (Monday, February 10)

• Lecture 2 Notes
• Lecture 2 Lecture Slides

Lecture 3 (Wednesday, February 12)

• Lecture 3 Notes: One Time Pad

Lecture 4 (Tuesday, February 18)

• Lecture 4 Notes: Cryptographic Hash Functions
• Introduction to Hashing Notes I, II, and III

Lecture 5 (Wednesday, February 19)

• Lecture 5 Notes: Hashing Applications and Constructions
• Lecture 5 Notes: Payword and Micromint

Lecture 6 (Monday, February 24)

• Lecture 6 Notes: Bitcoin

Problem Set 2 (Monday, February 24)

• Problem Set
• hashes.txt
• Problem2-2_Sol.py
• Sample Solutions: 2.1, another 2.1, and 2.3.

Lecture 7 (Wednesday, February 26)

• Lecture 7 Notes: Secret Sharing (only read the section on secret sharing)

Lecture 8 (Monday, March 3)

• Lecture 8 Notes: Block Ciphers

Lecture 9 (Wednesday, March 5)

• Lecture 9 Notes: Block Cipher Modes
• Block cipher mode of operation
• Desai's Paper on UFE Mode

Lecture 10 (Monday, March 10)

• Lecture 10 Notes: Message Authentication Codes
• The EAX Mode of Operation

Problem Set 3 (Monday, March 10)

• Problem Set
• kalns.py
• gf16_table.txt
• Sample Solutions: 3.2 and 3.3.

Lecture 11 (Wednesday, March 12)

• Lecture 11 Notes: Prime Finding and other "Crypto" Math
• Storage Requirement for AKS Primality Test

Lecture 12 (Monday, March 17)

• Lecture 12 Notes: Diffie-Hellman Key Exchange and Crypto Groups

Lecture 13 (Wednesday, March 19)

• Lecture 13 Notes: Pedersen Commitment, PK Encryption, DDH

Problem Set 4 (Monday, March 31)

• Problem Set

Lecture 14 (Monday, March 31)

• Lecture 14 Notes: Malleability of El Gamal, IND-CCA2
• New Directions in Cryptography
• Twenty Years of Attacks on the RSA Cryptosystem

Lecture 15 (Wednesday, April 2)

• Lecture 15 Notes: Digital Signatures

Lecture 16 (Monday, April 7)

• Lecture 16 Notes: DSA, Gap Groups

Lecture 17 (Wednesday, April 9)

• Lecture 17 Notes: Gap Groups, Bilinear Maps, and Applications
• Survey of Pairing-Based Crypto
• Pairing-Based Crypto Lounge

Lecture 18 (Monday, April 14)

• Lecture 18: Zero Knowledge Proofs
• A Short Tutorial of Zero-Knowledge
• Zero-Knowledge Solutions of Sudoku Puzzles

Lecture 19 (Wednesday, April 16)

• No lecture; Quiz

Lecture 20 (Monday, April 21)

• Lecture 20: Security of Voting

Lecture 21 (Wednesday, April 23)

• Lecture 21: Security of Voting
• Lecture 21 Security of Voting Slides

Problem Set 5 (Wednesday, April 23)

• Problem Set 5

Lecture 22 (Monday, April 28)

• Project Presentations

Lecture 23 (Wednesday, April 30)

• Project Presentations

Lecture 24 (Monday, May 5)

• Project Presentations

Lecture 25 (Wednesday, May 7)

• Project Presentations

Lecture 26 (Monday, May 12)

• No class; see Goldwasser lecture on Cryptographic Lens.

Lecture 26 (Wednesday, May 14)

• Guest lecture by Professor Vinod Vaikuntanathan on "Computing with Encrypted Data."
• Lecture 26 Slides
• Video: Princeton Intractability Center
• Slides: Penn State Summer School on Crypto