1. Foundations of Cryptography

Try these first

1. 1.

   Define what (n, t) secret sharing means.

   Hint

   Think about the total number of parties versus how many need to work together to access the secret.

2. 2.

   Explain the role of polynomials in Shamir's secret sharing scheme.

   Hint

   Consider how many points you need to define a polynomial.

3. 3.

   What does (n, t) secret sharing mean?

   • A method that requires all shareholders to access the secret
   • A model where 'n' parties share a secret but 't' parties are required for reconstruction
   • None of the above

   Hint

   Think about the relationship between the number of parties and how many are needed to reveal the secret.

4. 4.

   True or False: In Shamir's secret sharing, any number of shares below 't + 1' can reveal the secret.

   • True
   • False

   Hint

   Consider what you learned about what is required to access the secret effectively.

5. 5.

   Suppose you have a secret that is divided among 5 shareholders with a threshold of 2. Discuss the implications if 1 share was leaked and how many combinations remain secure.

   Hint

   Consider how the combinations of shares can either aid or hinder access to the secret.