In a secret sharing scheme, is distributed among several participants in such way that only any authorized subset of able to recover the secret. So far, security many schemes has been based on hardness some mathematical problems, as discrete logarithm and factorization. These problems can be solved polynomial time using Shor?s algorithm for quantum computer. this paper, we propose an efficient ...

This study proposes a novel multi-image threshold sharing scheme based on Chinese remainder theorem and Lagrange interpolation. The exceptional property of the scheme is its ability to retrieve any secret image without recovering all the other images. Therefore, it works efficiently and reduces computation cost in case it needs to recover only one image from shares. In term of capacity, the sch...

Although secret sharing techniques have been applied to implement secure electronic sealed-bid auction for a long time, problems and attacks still exist in secret-sharing-based electronic sealed-bid auction schemes. In this paper, a new secret-sharing-based first-bid e-auction scheme is designed to achieve satisfactory properties and efficiency. Correctness and fairness of the new auction are b...

We introduce two publicly cheater identifiable secret sharing (CISS) schemes with efficient reconstruction, tolerating t < k/2 cheaters. Our constructions are based on (k, n) threshold Shamir scheme, and they feature a novel application of multi-receiver authentication codes to ensure integrity of shares. The first scheme, which tolerates rushing cheaters, has the share size |S|(n−t)/ n+t+2 in ...

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.