Recently, a visual secret sharing scheme for q multiple secret images allowing the rotation of shares, a VSSq-MI-R schemes for short, is proposed by Iwamoto et al. In this paper, another definition of VSS-q-MI-R schemes is given, which is simpler than that by Iwamoto et al.

The notion of a regular anonymous perfect threshold scheme is introduced, and a combinatorial characterization for such a (2,w)-threshold scheme in terms of a regular difference family is given.  2002 Elsevier Science B.V. All rights reserved.

This note proposes a method of space efficient secret sharing in which k secrets are mapped into n shares (n ≥ k) of the same size. Since, n can be chosen to be equal to k, the method is space efficient. This method may be compared with conventional secret sharing schemes that divide a single secret into n shares.

Article history: Received 8 April 2013 Received in revised form 2 September 2013 Accepted 21 January 2014 Available online 23 January 2014 Communicated by V. Rijmen

Knowledge sharing, along with its potential predictors, has been a popular research topic. This research extends prior research by examining potential predictors of knowledge sharing together within a more comprehensive model with two additional contexts: the type of recipient of the knowledge is the recipients of intraorganizational broadcast media, and the type of knowledge sharing behavior (...

A secret sharing scheme for the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsets of participants cannot recover the master key. A secret sharing scheme is called perfect if any subset of participants who cannot recover the master key obtains no information regarding the master key. In this paper, we...

Article history: Received 4 November 2006 Received in revised form 28 February 2008 Accepted 29 May 2008

A secret sharing scheme is a method for distributing a secret among several parties in such a way that only quali.ed subsets of the parties can reconstruct it and unquali.ed subsets receive no information about the secret. A multi-secret sharing scheme is the natural extension of a secret sharing scheme to the case in which many secrets need to be shared, each with respect to possibly di2erent ...

In anonymous secret sharing schemes, the secret can be reconstructed without knowledge of which participants hold which shares. In this paper, we derive a tighter lower bound on the size of the shares than the bound of Blundo and Stinson for anonymous (k, n)threshold schemes with 1 < k < n. Our bound is tight for k = 2. We also show a close relationship between optimum anonymous (2, n)threshold...