This paper presents a novel secret sharing system that is based on Chinese remainder theorem. This scheme deals with a concept of multiple secrets to be shared to different groups, such that each group receives shares of secret intended for it. The sharing is a threshold scheme, that is more than a fixed number of members from any particular group, will be able to reconstruct the secret and any...

Proactive Secret Sharing (PSS) scheme is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme (SSS) without modifying the secret, or reconstructing the secret to reproduce new shares. Traditionally, PSS schemes are developed for the Shamir’s SSS which is a single SSS. Bai (2006) developed a multiple-secret sharing scheme using matrix projection. This ...

Threshold secret sharing schemes are ideal to protect confidential information. In this paper, we propose a novel distributed threshold secret sharing scheme based on spherical coordinates. As four non-coplanar points can determine a unique sphere, we design transformation algorithms to generate secret as sphere center and mapping algorithms to convert participants to be sphere surface p...

Preface A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) which are distributed to users. The secret may be recovered only by certain predetermined groups which belong to the access structure. Secret sharing schemes have been independently introduced by Blakley [12] and Shamir [134] as a solution for safeguarding cryptographic keys. Secret sharing...

In 1979, secret sharing schemes were first proposed by Blakley and Shamir. In a secret sharing scheme, each participant receives a share of a secret in such a way that only authorized subsets can reconstruct the secret. Later, Wu and He proposed a (t, n)-threshold scheme for sharing a secret based on a hyperspherical function (HS-TS). Their scheme give a practical algorithm to solve the problem...

Visual cryptography (VC) has been developed extensively based on its practicability. These schemes can encode a black-and-white secret image into several shadow images, and, by stacking a certain number of shadow images, can retrieve the secret image through the human visual system. In this paper, we employ Hsu et al.’s ideal multi-threshold secret sharing scheme based on monotone span programs...

This paper proposes a new construction of the visual secret sharing scheme for the (n, n)-threshold access structure applicable to color images. The construction uses matrices with n rows that can be identified with homogeneous polynomials of degree n. It is shown that, if we find a set of homogeneous polynomials of degree n satisfying a certain system of simultaneous partial differential equat...

Verifiable secret sharing schemes are important in cloud computing environments. Thus a key can be distributed over many servers by threshold secret sharing mechanism. The key is then reconstructed when needed. Secret sharing has also been suggested for sensor networks where the links are liable to be tapped by sending the data in shares which makes the task of the eavesdropper harder. The secu...