Question: Let s be a secret that is an integer between 0 and q . Bob designed an (n,n) secret sharing scheme using the addition operation.

Let s be a secret that is an integer between 0 and q .

Bob designed an (n,n) secret sharing scheme using the addition operation. It works in the following way:

  • To share the secret, the dealer chooses n 1 uniformly random number between 0 to q , d1, ... , dn1. The dealer computes the last share dn = s + d1 + d2 + dn1. The dealer gives di to the ith party.
  • To reconstruct the secret, compute s' = dn d1 d2 -dn1.

True/False, this addition based (n,n)-secret sharing scheme is correct, i.e. the secret can always be recovered?

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!