An on-line secret sharing scheme for multi-secrets

An efficient, computationally secure on-line secret sharing scheme is proposed in this paper. It provides great capabilities for many practical applications. In this scheme, each participant shares many secrets with other participants by holding only one shadow. The shadows are as short as the shared secret. They are selected by the participants themselves. Each participant is allowed to check whether another participant provides the true information or not in the recovery phase. The shadows do not need to be changed when the shared secret is renewed, the access structure is altered, and/or old participants are deleted or new participants are added. The security of our scheme is the same as that of the RSA cryptosystem and Shamir's (r,n)-threshold scheme. (C) 1998 Elsevier Science B.V.