Sharing a secret efficiently amongst a group of participants is not easy since there is always an adversary / eavesdropper trying to retrieve the secret. In secret sharing schemes, every participant is given a unique share. When the desired group of participants come together and provide their shares, the secret is obtained. For other combinations of shares, a garbage value is returned. A thres...

Secret sharing schemes as basic building blocks for many applications in distributed systems should be efficient and robust to any possible attacks. Based on bilinear pairing, this paper will propose a new (t, n) threshold verifiable multi-secret sharing scheme and a GGOC verifiable multi-secret sharing scheme that improve the security and minimizes the number of published values.

A secret sharing scheme permits a secret to be shared among participants in such a way that only qualiied subsets of participants can recover the secret, but any non-qualiied subset has absolutely no information on the secret. In this paper we consider the problem of designing eecient secret sharing schemes having the additional feature that qualiied minorities can forbid any other set of parti...

In this paper we partially determine the access structures of algebraicgeometric secret sharing schemes from one point algebraic-geometric codes associated with a hyperelliptic curve of any genus. Our result includes the access structures of elliptic secret sharing schemes as a special case.

Threshold secret sharing schemes are used to divide a given secret by a dealer in parts such that no less than the threshold number of shareholders can reconstruct the secret. However, these schemes are susceptible to the malicious behavior of a shareholder or a dealer. To prevent such attacks, it is necessary to make a provision for verification of the integrity of the shares distributed by th...

A proactive secret sharing scheme is a method of sharing a secret among a set of participants. And, the corresponding shadows can be periodically renewed under the premise of never changing the shared secret. However, in the most existing proactive secret sharing schemes, only one secret can be shared during one secret sharing process. The proposed scheme describes PMSS, a new way to share mult...

In this paper, we investigate a new concept, called share selectable secret sharing, where no unauthorized set can obtain information of the secret (in the information-theoretic sense) even if shares are selectable as arbitrary values which are independent of the secret. We propose two totally selectable (i.e., all users’ shares are selectable) secret sharing schemes with unanimous structure. W...

To evaluate the visual quality in visual secret sharing schemes, most of the existing metrics fail to generate fair and uniform quality scores for tested reconstructed images. We propose a new approach to measure the visual quality of the reconstructed image for visual secret sharing schemes. We developed an object detection method in the context of secret sharing, detecting outstanding local f...

This paper is an explication of secret sharing schemes, emphasizing combinatorial construction methods. The main problem we consider is the construction of perfect secret sharing schemes, for specified access structures, with the maximum possible information rate. In this paper, we present numerous direct constructions for secret sharing schemes, such as the Shamir threshold scheme, the Boolean...

There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access structures of the schemes based on linear codes is very hard. This paper proposed the concept of minimal linear code, which makes the determination of the access st...