ABSTRACT
At a later time, a subset of participants B ⊆ P pool their shares in an attempt to compute the secret key K. If |B| ≥ t, then they should be able to compute the value of K as a function of the shares they collectively hold; if |B| < t, then they should not be able to compute K. In Example 58.1, a (2, 3)-threshold scheme is desired.
