a. Say that we use Shamir secret sharing with t=3 and n=20 (where n is the total number of shares and t+1 is the minimum number of players to recover the secret). But there is a cheater that will just say a random number (say he got a share x, then he can give a number different from f(x)). How many people (minimum) do you need in order to recover the secret? Explain clearly.
b. We consider a (t+1=2,n=7) shamir secret scheme over Z11. Four players A,B,C,D cooperate to find the secret, but one of them is cheating (so the share he claims to have might not be an actual share). They claim that the shares are: A=(1,4), B=(3,7), C=(5,1), D=(7,2). Who is cheating and what is the secret?
Recently Asked Questions
- The following one-year "forward" rates exist for each of the years 2012-2016: 1/1/12 - 31/12/1220.00% 1/1/13 - 31/12/1325.00% 1/1/14 - 31/12/1420.00% 1/1/15 -
- X/5 = 12.5 How do I solve the x in the above problem?
- Capturing attention in social media, what does it mean to capture attention in social media and why is it important? What are some of the challenges for