MS-E1687 - Advanced topics in cryptography V, 07.01.2019-01.04.2019

Materials

• Materials
  

  Materials

  • Restricted Not available unless: You are a(n) Student

    01-02-Lecture-Notes File

    PDF document

    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
    

  • Restricted Not available unless: You are a(n) Student

    02-Lecture File

    Text file

    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

  • Restricted Not available unless: You are a(n) Student

    03-Lecture File

    PDF document
  • Restricted Not available unless: You are a(n) Student

    02-Lecture File

    PDF document

    These are the lecture notes of the second lecture, with minor corrections.

  • Restricted Not available unless: You are a(n) Student

    03-key-schedule.xml File

    application/xml
  • Restricted Not available unless: You are a(n) Student

    03-lecture.tex File

    application/x-tex
  • Restricted Not available unless: You are a(n) Student

    04-lecture-code File

    Text file
  • Restricted Not available unless: You are a(n) Student

    04-lecture File

    PDF document

    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

  • Restricted Not available unless: You are a(n) Student

    05-Lecture-1-TLS File

    Image (JPEG)

    This is a high-level description of the TLS 1.3 protocol.

  • Restricted Not available unless: You are a(n) Student

    05-Lecture-2-TLS File

    Image (JPEG)

    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.

  • Restricted Not available unless: You are a(n) Student

    05-Lecture-3-TLS File

    Image (JPEG)

    This 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.
  • Restricted Not available unless: You are a(n) Student

    05-Lecture-4-TLS File

    Image (JPEG)

    This is a high-level description of the TLS 1.3 protocol with more details.

  • Restricted Not available unless: You are a(n) Student

    05-Lecture-5-TLS File

    Image (JPEG)

    TLS 1.3 key schedule (without modelling)
  • Restricted Not available unless: You are a(n) Student

    05-Lecture-Notes File

    PDF document

    These lecture notes contain additional information on the protocols that you analyze.
  • Restricted Not available unless: You are a(n) Student

    04 lecture - xml for figure 8 File

    application/xml
  • Restricted Not available unless: You are a(n) Student

    06-Lecture File

    PDF document

    This is a sketch of the current TLS 1.3 key schedule analysis.

  • Restricted Not available unless: You are a(n) Student

    07-lecture File

    PDF document

    Feb 25: Draft

    Mar 4: First version

  • Restricted Not available unless: You are a(n) Student

    08-Lecture File

    PDF document

    These are the handwritten lecture notes by Ameet Gadekar :-) Thanks, Ameet!

  • Restricted Not available unless: You are a(n) Student

    09-Impagliazzo File

    PDF document

    This is a relevant paper by Impagliazzo that was (implicitly) used in the lecture today and might be interesting to read.

  • Restricted Not available unless: You are a(n) Student

    09-Lecture File

    PDF document

    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.

  • Restricted Not available unless: You are a(n) Student

    Model Solution to Assignment 06 File

    PDF document Uploaded 15/03/19, 22:42
  • Restricted Not available unless: You are a(n) Student

    10-Lecture File

    PDF document

    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".

  • Restricted Not available unless: You are a(n) Student

    07-Model solutions File

    PDF document
  • Restricted Not available unless: You are a(n) Student

    11-Lecture File

    PDF document

    In this lecture, we further explore relations between SZK hardness and PAC-learning.

    Update March 31, 2019: Included reference to Ostrovsky-Wigderson.

  • 08-Model solutions File PDF document
  • Restricted Not available unless: You are a(n) Student

    12-Lecture File

    PDF document

    PDF version. You can consult the PPT file for animations. You can consult Exercise Sheet 10 for definitions.
  • Restricted Not available unless: You are a(n) Student

    12-Lecture-PPT File

    Powerpoint presentation

    PPT version. You can consult the PDF file for non-animated variant. You can consult Exercise Sheet 10 for definitions.