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.
(1) Designing sound key derivation for the protocols.
(2) Key Schedule abstraction for the protocols
(3) Statistical Distance
This file contains assignment 3 and 4. Protocol analysis, i.e., assumptions and reductions.
This assignment is just to give you points of the presentation. You don't have to submit anything.
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
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
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.
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*.
Exercise sheet on indistinguishability obfuscation, statistical distance and course feedback.