Question: Let s be a secret that is L bits long. Tom designed an (n,n) secret sharing scheme using the AND operation. It works in the
Let s be a secret that is L bits long.
Tom designed an (n,n) secret sharing scheme using the AND operation. It works in the following way:
- To share the secret, the dealer chooses n 1 uniformly random bit strings, d1, ... ,dn1, each di is L bits long. 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' = d1 d2 dn1 dn
True/False, this AND 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
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
