MS-E1687 - Advanced Topics in Cryptography V D, Lecture, 8.1.2024-8.4.2024
This course space end date is set to 08.04.2024 Search Courses: MS-E1687
09 Assignment
Recommended deadline: March 22, 2024 (I promise to include the questions)
Cut-off deadline: March 25, noon (if submitting on Friday is stressful, you can submit up to the cut-off deadline. The earlier you submit, the more likely it is that I include the questions into the Monday discussions.)
Discussion: March 25, 2024, 12:30
Exercise 1: Ask questions (2 points)
Exercise 2 (max. 3 points out of 4, you can, but do not need to answer all):
(a) Explain what the random oracle model is (1 points). [You can also Google further info beyond this paper...]
(b) Explain how, conceptually, the event QueryRO helps the adversary break OWVwFS (1 point).
(c) Can we easily replace the random oracle with a collision-resistant hash-function so that the same proof still goes through? Explain how or why not (1 point).
(d) In Assignment 8, we read that a multiplicative loss in the number of parties is inherent in some sense, while this paper can avoid a multiplicative loss in the number of parties. Why is there no contradiction between the statement in Assignment 8 and the statement made in this paper?
- 20 March 2024, 1:58 AM