A resilient secret sharing scheme is supposed to generate the secret correctly even after some shares are damaged. In this paper, we show how quantum error correcting codes can be exploited to design a resilient quantum secret sharing scheme, where a quantum state is shared among more than one parties.

Visual Cryptography is a secret sharing scheme that uses the human visual system to perform computations. This paper presents a recursive hiding scheme for 3 out of 5 secret sharing. The idea used is to hide smaller secrets in the shares of a larger secret without an expansion in the size of the latter.

A perfect secret sharing scheme permits a secret to be shared among participants so that only qualified subsets of participants can reconstruct the secret, but any unqualified subset has absolutely no information about the secret. In this paper, we first show that the general secret sharing scheme with a coterie access structure is perfect if the coterie is nondominated (ND). We then propose a ...

quantum secret sharing where a quantum participant Alice can share a secret key with two classical participants Bobs. After analyz.Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is. Quantum cryptography with secret sharing in a way that will.We show how a quantum secret sharing protocol, similar to that of Hillery, Buzek, and Berthiaume. A pr...

Secret sharing schemes are one of the most important primitives in distributed systems. In perfect secret sharing schemes, collaboration between unauthorised participants cannot reduce their uncertainty about the secret. This paper presents a perfect secret sharing scheme arising from critical sets of Room squares.

In the paper we propose general framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying secret sharing scheme. ASGS allows to prevent the dealer from knowing the secret or even to eliminate him at all. Two situations are discussed. First concerns simultaneous generation and sharing of the random, prior nonexistent secret. Such a secret remains unkno...

Secret sharing schemes are one of the most important primitives in distributed systems In perfect secret sharing schemes collabo ration between unauthorised participants cannot reduce their uncer tainty about the secret This paper presents a perfect secret sharing scheme arising from critical sets of Room squares

Abstract— Multi-secret sharing scheme based on cellular automata have proven to be a secure encrypting algorithm, although it cannot guarantee data integrity and authenticity of shares of the participants, allowing a chosen cipher text attack. In this work, to improve the security of multiple secret sharing scheme (SSS) against adaptive chosen cipher text attack, we introduce an authenticated e...