A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

In [3] Damgard and Thorbek proposed the linear integer secret sharing (LISS) scheme. In this note we show that the LISS scheme can be made proactive.

Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is m times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only...

For a secret sharing scheme, two parameters dmin and dcheat are defined in [1] and [2]. These two parameters measure the errorcorrecting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [1-3]. The MDS secret-sharing scheme is defined in [2] and it is proved that MDS perfect secret sharin...

A , (m  ) n threshold secret sharing scheme is a method for distributing a secret amongst a group of participants. In a , (m  ) n threshold secret sharing scheme any m participants recover the secret, but no ) 1 (  m participants can [6]. Each of participants is allocated a share of the secret. The secret can only be reconstructed when the shares are combined together [2]. In this paper, we ...

We first explain the notion of secret sharing and also threshold schemes, which can be implemented with the Shamir’s secret sharing. Subsequently, we review social secret sharing [6,10] and its trust function. In a secret sharing scheme, a secret is shared among a group of players who can later recover the secret. We review the construction of a social secret sharing scheme and its application ...

A publicly verifiable secret sharing scheme is more applicable than a verifiable secret sharing because of the property that the validity of the shares distributed by the dealer can be verified by any party. In this paper, we construct a non-interactive and informationtheoretic publicly verifiable secret sharing by a computationally binding and unconditionally hiding commitment scheme and zero-...

For a secret sharing scheme, two parameters dmin and dcheat are defined in [12] and [13]. These two parameters measure the errorcorrecting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [12],[9] and [13]. The MDS secretsharing scheme was defined in [13] and it was proved that MDS perfe...

The generalized secret sharing scheme is a method used to divide secret into a set of participants such that only the qualified subsets of participants can reconstruct the secret. In this paper, we first propose a new generalized secret sharing scheme with cheater detection. The security of the scheme is based on discrete logarithm problem. Based on this scheme, we present a group-oriented gene...