MS-E1687 - Advanced topics in cryptography V, 07.01.2019-01.04.2019
This course space end date is set to 01.04.2019 Search Courses: MS-E1687
Översikt
-
-
01-02-Lecture-Notes Fil PDF
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
-
02-Lecture Fil TXT
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
-
03-Lecture Fil PDF
-
02-Lecture Fil PDF
These are the lecture notes of the second lecture, with minor corrections.
-
03-key-schedule.xml Fil XML
-
03-lecture.tex Fil TEX
-
04-lecture-code Fil TXT
-
04-lecture Fil PDF
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
-
05-Lecture-1-TLS Fil JPG
This is a high-level description of the TLS 1.3 protocol.
-
05-Lecture-2-TLS Fil JPG
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.
-
05-Lecture-3-TLS Fil JPGThis is a 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.
-
05-Lecture-4-TLS Fil JPG
This is a high-level description of the TLS 1.3 protocol with more details.
-
05-Lecture-5-TLS Fil JPGTLS 1.3 key schedule (without modelling)
-
05-Lecture-Notes Fil PDFThese lecture notes contain additional information on the protocols that you analyze.
-
04 lecture - xml for figure 8 Fil XML
-
06-Lecture Fil PDF
This is a sketch of the current TLS 1.3 key schedule analysis.
-
07-lecture Fil PDF
Feb 25: Draft
Mar 4: First version
-
08-Lecture Fil PDF
These are the handwritten lecture notes by Ameet Gadekar :-) Thanks, Ameet!
-
09-Impagliazzo Fil PDF
This is a relevant paper by Impagliazzo that was (implicitly) used in the lecture today and might be interesting to read.
-
09-Lecture Fil PDF
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.
-
Model Solution to Assignment 06 Fil PDFUppladdad 2019-03-15 22:42
-
10-Lecture Fil PDF
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".
-
07-Model solutions Fil PDF
-
11-Lecture Fil PDF
In this lecture, we further explore relations between SZK hardness and PAC-learning.
Update March 31, 2019: Included reference to Ostrovsky-Wigderson.
-
12-Lecture Fil PDFPDF version. You can consult the PPT file for animations. You can consult Exercise Sheet 10 for definitions.
-
12-Lecture-PPT Fil PPTPPT version. You can consult the PDF file for non-animated variant. You can consult Exercise Sheet 10 for definitions.
-