An optimal multisecret threshold scheme construction
A multisecret threshold scheme is a system which protects a number of secret keys among a group of n participants. There is a secret s(K) associated with every subset K of k participants such that any t participants in K can reconstruct the secret s(K), but a subset of w participants cannot get any information about a secret they are not associated with. This paper gives a construction for the parameters t = 2, k = 3 and for any n and w that is optimal in the sense that participants hold the minimal amount of information.
secret sharing schemes multisecret schemes geometrical construction