This research paper introduces a scheme to secure any secret value in cloud network by Mobile Proactive Secret Sharing (MPSS). This is an extension of proactive secret sharing, where contributing parties of a network hold the shares of a secret value. Mobile proactive secret sharing is much more flexible than proactive secret sharing in terms of group membership: instead of the group of shareho...

Cryptographic techniques, such as encipherment, digital signatures, key management and secret sharing schemes, are important building blocks in the implementation of all security services. In this thesis, we present a general model for online secret sharing schemes and investigate the design of online secret sharing schemes which are derived from this model such as Cachin and Pinch’s schemes [1...

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition, some secrets may require a higher security level than others involving t...

C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification. A practical verifiable multi-secret sharing scheme, which is based on ...

A (t + 1, n) proactive secret sharing is to protect a secret in long-lived system by distributing it to a group of n participants and refreshing their shares periodically in this fixed group, while any t+1 and more than t+1 shares can reconstruct the secret. In some environment, it needs to change not only the number of participants n but also the threshold value t. An adaptive proactive secret...

A new multipartite secret sharing scheme that uses a super increasing sequence is proposed in this paper. Novelty of the scheme is that, apart from being a multipartite scheme, it realizes the level ordered access structure [17]. Also, the proposed scheme is reusable in that the shares of the participants need not be replenished for a new secret after the reconstruction the current secret.

The algebraic setting for threshold secret sharing scheme can vary, dependent on the application. This algebraic setting can limit the number of participants of an ideal secret sharing scheme. Thus it is important to know for which thresholds one could utilize an ideal threshold sharing scheme and for which thresholds one would have to use nonideal schemes. The implication is that more than one...

Secret sharing is an efficient method for transmitting the image securely. This paper proposes an efficient secret sharing scheme for secret image. The protocol allows each participant to share a secret gray image with the rest of participants. In our scheme, a secret digital image is divided into n pieces, which are further distributed into n participants. The secret digital image can be recon...

The visual secret sharing (VSS for short) scheme is a secret image sharing scheme. A secret image is visually revealed from overlapping shadow images without additional computations. However, the contrast of reconstructed image is much lost. By means of the reversing operation (reverse black and white), Viet and Kurosawa used the traditional VSS scheme to design a VSS scheme which the secret im...

A secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualiied subsets. The setting we consider is the following: in a rst phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qua...