Practice Foundations Of Cryptography (1) - Basics 23 - Discrete Mathematics - Vol 3

Practice: Foundations of Cryptography

Lesson 1Basics 23

Practise this section

5 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

5 sample questions

Question 1.
Define what (n, t) secret sharing means.
Show hintHide hint
Think about the total number of parties versus how many need to work together to access the secret.
Question 2.
Explain the role of polynomials in Shamir's secret sharing scheme.
Show hintHide hint
Consider how many points you need to define a polynomial.
3Question 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
Show hintHide hint
Think about the relationship between the number of parties and how many are needed to reveal the secret.
4Question 4.
True or False: In Shamir's secret sharing, any number of shares below 't + 1' can reveal the secret.
- True
- False
Show hintHide hint
Consider what you learned about what is required to access the secret effectively.
Question 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.
Show hintHide hint
Consider how the combinations of shares can either aid or hinder access to the secret.

1 more question in this section. Enroll free to practise them all.