Secret Sharing and Secure Computation

Splitting a secret so that any t shares reveal it and any t−1 reveal nothing, and computing on data nobody is allowed to see.0/90 mastered

1 / 90

In a

(k,n)

-threshold scheme with

k=3

and

n=7

, what is the smallest number of shares that suffices to reconstruct the secret?

Your answer

#13064