Question: Say a public-key encryption scheme (Gen,Enc,Dec) for n-bit messages is one-way if any ppt adversary A has negligible probability of success in the following experiment:
Say a public-key encryption scheme (Gen,Enc,Dec) for n-bit messages is one-way if any ppt adversary A has negligible probability of success in the following experiment:
Gen(1n) is run to obtain keys (pk,sk).
A message m {0,1}n is chosen uniformly at random, and a ciphertext c Encpk(m) is computed.
A is given pk and c, and outputs a message m'. We say A succeeds if m'=m.
QUESTION: Can a deterministic public-key encryption scheme be one-way? If not, prove impossibility; if so, give a construction based on any of the assumptions introduced in this book
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
