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

Visual Cryptography comes under cryptography domain. It deals with encrypting and decrypting of visual information like pictures, texts, videos etc. Multi Secret Image Sharing (MSIS) scheme is a part of visual cryptography that provides a protected method to transmit more than one secret images over a communication channel. Conventionally, transmission of a single secret image is possible over ...

We present a stronger notion of veriiable secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever veriiable secret sharing is used as a tool within larger protocols, rather than being a goal in itself.

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

The ( ) , t n threshold secret sharing scheme proposed by Shamir (1979) encodes the secret key into n shares and those shares are distributed among the participants. Each share incorporates an x-value uniquely designated for every single participant. If the shares are distributed on insecure (or public) channels, malicious users may acquire a few (or all) shares. If the number of shares obtaine...

0167-8655/$ see front matter 2012 Published by http://dx.doi.org/10.1016/j.patrec.2012.04.010 ⇑ Corresponding author. Address: Department of Computer Science, Feng Chia University, No. 100 We 40724, Taiwan. Tel.: +886 4 24517250x3790; fax: +8 E-mail addresses: [email protected] (C. Guo Chang). In this paper, we consider the problem of secret image sharing in groups with multi-threshold access s...

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

In this paper, we will study the question of performing arbitrary updates in secret sharing schemes when shares of unaffected parties shall remain unchanged. We will introduce a zonal transformation matrix in the lifetime of secret sharing schemes to simplify constructions of multitime secret sharing schemes and propose management models that allow unlimited updates from arbitrary schemes witho...