We present a novel method for constructing linear secret sharing schemes (LSSS) from linear error correcting codes and linear universal hash functions in a blackbox way. The main advantage of this new construction is that the privacy property of the resulting secret sharing scheme essentially becomes independent of the code we use, only depending on its rate. This allows us to fully harness the...

The generalized secret sharing scheme is a method used to divide secret into a set of participants such that only the qualified subsets of participants can reconstruct the secret. In this paper, we first propose a new generalized secret sharing scheme with cheater detection. The security of the scheme is based on discrete logarithm problem. Based on this scheme, we present a group-oriented gene...

In a group-oriented threshold cryptosystem, each group, instead of each individual member within the group, publishes a single group public key. An outsider can use this group public key to send encrypted messages to the group. However, the received encrypted messages can only be decrypted properly when the number of participating members is larger than or equal to the threshold value. All earl...

This paper first reviews some basic properties of cryptographic hash function, secret sharing scheme, and Latin square. Then we discuss why Latin square or its critical set is a good choice for secret representation and its relationship with secret sharing scheme. Further we enumerate the limitations of Latin square in a secret sharing scheme. Finally we propose how to apply cryptographic hash ...

A new grayscale image encryption algorithm based on , threshold secret sharing is proposed. The scheme allows a secret image to be transformed into n shares, where any shares can be used to reconstruct the secret image, while the knowledge of 1 or fewer shares leaves no sufficient information about the secret image and it becomes hard to decrypt the transmitted image. In the proposed scheme, th...

Multiplicative threshold schemes are useful tools in threshold cryptography. For example, such schemes can be used with a wide variety of practical homomorphic cryptosystems (such as the RSA, the El Gamal and elliptic curve systems) for threshold decryption, signatures, or proofs. The paper describes a new recursive construction for multiplicative threshold schemes which makes it possible to ex...

Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direction, this paper presents a novel approach to share a secret among a hierarchy of users while overcoming the limitations of the already existing mechanisms. Our work is based on traditional (k+ 1, n)-threshold secret sharing, which is secure as long as an advers...

In [1], Li et al. proposed a new type of signature scheme, called the (t, n) thresholdmutisignature scheme. The first one needs a mutually trusted share distribution center (SDC) while the second one does not. In this paper, we present a security analysis on their second schemes. We point out that their second threshold-multisignature scheme is vulnerable to universal forgery by an insider atta...

a r t i c l e i n f o a b s t r a c t Shamir's (t, n) secret sharing scheme (SS) is based on a univariate polynomial and is the most cited SS in the literature. The secret in a (t, n) SS can be recovered either by exactly t or more than t shareholders. Most SSs only consider when there are exactly t shareholders participated in the secret reconstruction. In this paper, we examine security issue...

This paper proposes a dealer-free threshold changeable construction for secret sharing schemes. In practice, the adversary’s ability might be enhanced over time, for instance by compromising more players. This problem can be resolved only by increasing the threshold. In the literature, there exist some techniques to address this issue. These solutions either have a large storage requirement or ...