Question: 1 0 . If an encryption scheme is IND - CPA secure , show that the set Dec 1 ( m ) ( the set

10. If an encryption scheme is IND-CPA secure, show that the set Dec1
(m)(the set of all
ciphertexts that would decrypt to m) must not be of polynomial size in the security
parameter for any efficiently computable message m. Conclude in particular that a
public-key, deterministic encryption scheme (like vanilla RSA) can never be IND-CPA
secure.

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!