Question: Let (G,E,D) be a public-key encryption (PKE) scheme (without decryption error). Show that perfectly secure PKE do not exist. For that, show that given pk

Let (G,E,D) be a public-key encryption (PKE) scheme (without decryption error).

Show that perfectly secure PKE do not exist.

For that, show that given pk and a ciphertext c computed as c = E(pk,m), it is possible for a computationally unbounded adversary to determine m with probability 1.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!