Hi,

From lecture 1:

How do we show that the 4th definition of perfect secrecy is equivalent to the others?

(The one with the fact that for a subset S the probability to output the message after encrypting is less than 1/|S|).

Thanks

*Instructor:*- Nir Bitansky
*Location and Hours:*- Wolfson 130, Thursday 10:00 - 13:00

*Assignment 5 due*: Jan 23*Make up class*: Jan 24*Exam*: Feb 3*Moed B*: Mar 3

**Reference solution for problem 5**

(28 Jan 2020 18:38)

**Reference solution for HW4**

(22 Jan 2020 12:51)

**Make up class**

(21 Jan 2020 22:07)

Yes. Note that given a public key $pk$ sampling a matching secret key is at least as hard as...

(by nbitansky 02 Feb 2020 07:35, posts: 6)

(by nbitansky 02 Feb 2020 07:35, posts: 6)

Thanks!
So if I generated a pair of (sk_1,pk) and you generated the pair (sk_2,pk), I will be...

(by Amit (guest) 02 Feb 2020 07:15, posts: 6)

(by Amit (guest) 02 Feb 2020 07:15, posts: 6)

No, it doesn't. By the correctness of the scheme it must be decrypted under both keys to...

(by nbitansky 02 Feb 2020 06:47, posts: 6)

(by nbitansky 02 Feb 2020 06:47, posts: 6)

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License