Question: Let consider the following protocol Anna has a 128-bit random string b Tom wants to prove that he knows b Tom sends a 128-bit string

Let consider the following protocol

  • Anna has a 128-bit random string b
  • Tom wants to prove that he knows b
  • Tom sends a 128-bit string b' to Anna
  • Anna accepts if b = b', otherwise reject

Is this an interactive proof?

1: No, because it is not complete

2: No, because it is not sound

3: No, because the proof cannot be verified in polynomial time

4: Yes it is.

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!