A (t, n) secret sharing scheme [1, 2] allows a secret to be shared among n users in such a way that only t or more users can reconstruct the secret, but any t − 1 or less users have absolutely no information about the secret. One common drawback of almost all known secret sharing schemes is that they are one-time schemes. That is, once any t or more users reconstruct the secret by pooling their...

Proactive Secret Sharing (PSS) scheme is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme (SSS) without modifying the secret, or reconstructing the secret to reproduce new shares. Traditionally, PSS schemes are developed for the Shamir’s SSS which is a single SSS. Bai (2006) developed a multiple-secret sharing scheme using matrix projection. This ...

A multi{secret sharing scheme is a protocol to share a number of (arbitrarily related) secrets among a set of participants in such a way that only quali ed sets of participants can recover the secrets, whereas non-quali ed sets of participants might have partial information about them. In this paper we analyze the amount of randomness needed by multi{secret sharing schemes. Given an m-tuple of ...

quantum information, secret sharing, quantum cryptography, quantum computation We investigate the concept of quantum secret sharing, where a secret quantum state is distributed between n parties in such a way that certain subsets of the parties can jointly recover the secret, while other subsets of the parties can acquire absolutely no information about it. In a ((k,n)) threshold scheme, any su...

The Secret Sharing scheme assumes long-lived shares. However the protection provided for such long lived and sensitive shares may be insufficient. The security in a system that is exposed to attacks and break-ins might become exhausted. The goal of the pro-active security scheme is to prevent the adversary from learning the secret or from destroying it. The Shamir’s Secret Sharing is pioneer me...