ELE 538: Information Theoretic Security - Schedule
Lecture Schedule
| | Tuesday | Thursday |
September | Week 1 | | Ciphers and the one-time-pad (notes1, notes2) |
| Week 2 | Entropy and Mutual Information (notes) | Entropy and Mutual Information (notes) |
| Week 3 | Typical Set (notes) | Channel Coding (notes) |
October | Week 4 | Channel Capacity Proof (notes) | Source Coding (notes) |
| Week 5 | Strong Typical Set and Source Coding Proof (notes) | Slepian-Wolf and MAC Intro (notes) |
| Week 6 | Multiple Access Channel (notes) | Broadcast Channel and Wiretap Channel (notes) |
| Week 7 | Wiretap Converse and Non-degraded (notes, slides) | Soft Covering (notes, slides) |
| | Fall Break | Fall Break |
November | Week 8 | Total Variation (notes) | Secrecy Metrics and Wiretap Channel (notes) |
| Week 9 | Gelfand-Pinsker (notes) | Gelfand-Pinsker Wiretap (notes) |
| Week 10 | Secret Key Agreement (notes) | Thanksgiving |
| Week 11 | Secret Key Agreement (notes) | Gelfand-Pinsker Wiretap (notes) |
December | Week 12 | GP WTC and Wyner-Ziv (notes) | Distributed Channel Synthesis (notes) |
| Week 13 | Secure Source Coding (notes) | Differential Privacy (notes)
|
Problem sets
Due Sept. 29, from Cover-Thomas 2nd Ed.: 2.1, 2.4, 2.8, 2.9, 2.10, 2.17, 2.37, 2.41, 3.4, 3.10, 3.11, 3.13 (for 2.37, instead of expanding as entropies, expand as the sum of two mutual information terms) - Solutions
Due Oct. 20: Problem Set 2
Due Nov. 29: Problem Set 3
Due Dec. 15: Problem Set 4 - Solutions
Papers for 15-minute in-class presentations
|