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

Topic outline

• Assignments
  • Select activity 01-Assignment

    Not available unless: You are a(n) Student

    

    01-Assignment

    Freshness condition and partnering function

    If you want to take part in the assignment and have not received a protocol yet, please write to Pihla and Chris. Note that generating a protocol takes 2-3 working days.

  • Select activity 02-Assignment

    Not available unless: You are a(n) Student

    

    02-Assignment

    Topics:
    (1) Designing sound key derivation for the protocols.
    (2) Key Schedule abstraction for the protocols
    (3) Statistical Distance
    
  • Select activity 03-04-Assignment

    Not available unless: You are a(n) Student

    

    03-04-Assignment

    This file contains assignment 3 and 4. Protocol analysis, i.e., assumptions and reductions.

  • Select activity 05-Assigment

    Not available unless: You are a(n) Student

    

    05-Assigment Assignment

    This assignment is just to give you points of the presentation. You don't have to submit anything.

  • Select activity 06-Assignment

    Not available unless: You are a(n) Student

    

    06-Assignment

    This exercise is aimed at giving an opportunity to practice the concept of uniformity and non-uniformity as well as the equivalence of the hardness of search problems and decision problems in the worst-case.

    EDIT 4.3.2019 16:08 (clarification):

    The 'advice' (a_n) that is mentioned in the exercise is a bitstring that should depend on the length of the input but not on the contents of the input.

    EDIT 9.3.2019: fix typo in the assignment title (3 and 4 ==> 6) and update correct dl to the pdf too

  • Select activity 07-Assignment

    Not available unless: You are a(n) Student

    

    07-Assignment

    This assignment is still under progress (one exercise is still missing and will be added later), but feel free to get started with the assignment anyway.

    EDIT 7.3.2019 20:31: replaced 1/1000 by 1/10000 in the very last definition
    

    EDIT 11.3.2019 17:05: fix a few typos (tcp ==> tpc and poly q ==> poly p in tcpBPP definitions) and add Exercise 19

  • Select activity 08-Exercise

    Not available unless: You are a(n) Student

    

    08-Exercise Assignment

    Learning theory and zero-knowledge. If you submit the assignment on Thursday 21st March, I'll give the feedback already by Sunday (but feel free to submit anytime before 29th March).

    EDIT 18.3.2019: add clarification in ex 22 that d is the depth.

  • Select activity 09-Exercise

    Not available unless: You are a(n) Student

    

    09-Exercise Assignment

    Exercises to practice statistical distance and the notion of a distributionally one-way function.

    April 1, 2019, 00:18: Corrected the last exercise. In the second line, it should be *non-isomorphic*.

  • Select activity 10-Exercise

    Not available unless: You are a(n) Student

    

    10-Exercise Assignment

    Exercise sheet on indistinguishability obfuscation, statistical distance and course feedback.