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...

We propose efficient secret sharing schemes realizing general access structures. Our proposed schemes are perfect secret sharing schemes and include Shamir’s (k, n)-threshold schemes as a special case. Furthermore, we show that a verifiable secret sharing scheme for general access structures is realized by one of the proposed schemes. key words: (k, n)-threshold scheme, general access structure...

In a classical secret sharing scheme, some sensitive classical data is distributed among a number of people such that certain sufficiently large sets of people can access the data, but smaller sets can gain no information about the shared secret. For instance, a possible application is to share the key for a joint checking account shared by many people. No individual is able to withdraw money, ...

Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an ...

Verifiable secret sharing schemes (VSS) are secret sharing schemes dealing with possible cheating by the participants. In this paper, we propose a new unconditionally secure VSS. Then we construct a new proactive secret sharing scheme based on that VSS. In a proactive scheme, the shares are periodically renewed so that an adversary cannot get any information about the secret unless he is able t...

A secret sharing scheme is a method to distribute a secret among a set of participants, such that only qualified subsets of the participants can recover the secret. A secret sharing scheme is perfect if any unqualified subset obtains no information regarding the master key. The collection of qualified subsets is called access structure. In a hypergraph, if the size of edges is equal to r, the h...