Proactive Secret Sharing Scheme (PSSS) is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme without modifying the secret or reconstructing the secret to reproduce new shares. Given enough time, a hacker may be able to compromise enough shares (k or more) to gain the secret. PSSS is a scheme that allows generating new set of shares for the same secr...

Visual Secret Sharing (VSS), first invented by Naor and Shamir, is a variant of secret sharing. In the literature, VSS schemes have many applications, including visual authentication and identification, steganography, and image encryption. Moreover, VSS schemes provide the secure services in communications. In 2010, De Prisco and De Santis deeply discussed the problem of cheating in VSS, gave t...

Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive weight. A dealer wishes to distribute a secret among those users so that a subset of users may reconstruct the secret if and only if the sum of weights of its users exceeds a certain threshold. A secret sharing scheme ...

We present a stronger notion of veri able secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever veri able secret sharing is used as a tool within larger protocols, rather than being a goal in itself.

Function sharing deals with the problem of distribution of the computation of a function (such as decryption or signature) among several parties. The necessary values for the computation are distributed to the participating parties using a secret sharing scheme (SSS). Several function sharing schemes have been proposed in the literature, with most of them using Shamir secret sharing as the unde...

A perfect secret-sharing scheme is a method to distribute a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of participants in any unqualified subset is statistically independent of the secret. The collection of all qualified subsets is called the access structure of the perfect secret-sharing scheme. In a g...

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