Question: Consider a t - out - of - n threshold secret sharing scheme with messages l bits long and where each user s share is

Consider a t-out-of-n threshold secret sharing scheme with messages l bits long and where each users share is also a string of bits. Prove that if the scheme is secure, then every users share must be at least l bits long.

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!