Question
34. Recall that we define a cipher to be secure if the best known attack is an exhaustive key search. If a cipher is secure
34. Recall that we define a cipher to be secure if the best known attack is an exhaustive key search. If a cipher is secure and the key space is large, then the best known attack is computationally infeasiblefor a practical cipher, this is the ideal situation. However, there is always the possibility that a clever new attack could change a formerly secure cipher into an insecure cipher. In contrast, Shamir's polynomial-based secret sharing scheme is information theoretically secure, in the sense that there is no possibility of a shortcut attack. In other words, secret sharing is guaranteed to be secure forever.
a. Suppose we have a "2 out of 2" secret sharing scheme, where Alice and Bob share a secret S. Why can't Alice determine any information about the secret from her share of the secret?
b. Suppose we have an "m out of n" secret sharing scheme. Any set of m 1 participants can't determine any information about the
secret S. Why?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started