Secret-sharing is an important topic of cryptography and has applications in information security. One approach to the construction of secret-sharing schemes is based on error-correcting codes. In this paper, we describe a secret-sharing scheme based on a class of ternary codes (Ding et al. IEEE Trans. Inform. Theory IT-46 (2000) 280–284). We determine the access structure and prove properties ...

An n-player (t, δ)-secure robust secret sharing scheme is a (t, n)-threshold secret sharing scheme with the additional property that the secret can be recovered, with probability at least 1− δ, from the set of all shares even if up to t players provide incorrect shares. The existing constructions of robust secret sharing schemes for the range n/3 ≤ t < n/2 have the share size larger than the se...

In this paper, a method is proposed to construct a visual secret sharing (VSS) scheme for multiple secret images in which each share can be rotated with 180 degrees in decryption. The proposed VSS scheme can encrypt more number of secret images compared with the normal VSS schemes. Furthermore, the proposed technique can be applied to the VSS scheme that allows to turn over some shares in decry...

Secret sharing is of great importance for sharing secret or confidential information. This information can be in the form of documents, images, photographs and many more. Most of the previous visual secret sharing scheme uses shares to conceal secret images. The shares may be printed or in digital form. When the secret image is hidden into the shares, noise-like pixel appears which increase the...

Visual secret sharing scheme (VSSS) is a secret sharing method which decodes the secret by using the contrast ability of the human visual system. Autostereogram is a single two dimensional (2D) image which becomes a virtual three dimensional (3D) image when viewed with proper eye convergence or divergence. Combing the two technologies via human vision, this paper presents a new visual secret sh...

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