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 secret sharing scheme is perfectly secure, i.e. no information is leaked about the secret from any proper subset of the shares?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
