In these lecture notes, we explain the main reduction methodology used in the course. The lecture notes are currently still missing 1 definition.
January 9, 2019, 00:12: Update, fixed several typos, also in the figures.
January 10, 2019, 13:08: Update, added motivation/explanation for secure channel definition
January 14, 2019, 04:34: Update of administrative information
February 04, 2019, 16:45: Added decomposed $-AE notion and details on last proof
This is a first draft of the lecture notes on key exchange. The pseudo-code is still missing, but most of the conceptual discussion is already available.
Jan 14, 4:04: Substantial update
Jan 16, 16:47: Included all the oracles in the txt-file
These are the lecture notes of the second lecture, with minor corrections.
Updated Jan 28: add slightly improved code in pdf
Updated Jan 31: edited footnote 1 on the random oracle methodology to present a more balanced view on the topic
This is a high-level description of the TLS 1.3 protocol.
This is a high-level description of the TLS 1.3 protocol with some additional details. We will not include the red text in the modelling. It is only included for discussion.
This is a high-level description of the TLS 1.3 protocol with more details.
This is a sketch of the current TLS 1.3 key schedule analysis.
Feb 25: Draft
Mar 4: First version
These are the handwritten lecture notes by Ameet Gadekar :-) Thanks, Ameet!
This is a relevant paper by Impagliazzo that was (implicitly) used in the lecture today and might be interesting to read.
March 11: This is a first draft of the lecture notes, only the definitional part so far and the high-level lecture overview, more to come.
March 16: Update on content and references to non-black-box techniques. The oracle separation proof is still missing. You can read Impagliazzo's paper in the meanwhile.
Learning theory and zero-knowledge proofs
March 23: Corrected the phrasing of soundness, included cheating prover algorithm and changed "greater or equal to" into "smaller or equal to".
In this lecture, we further explore relations between SZK hardness and PAC-learning.
Update March 31, 2019: Included reference to Ostrovsky-Wigderson.