In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...

in a multi-secret sharing scheme, several secret values are distributed among a set of n participants.in 2000 chien et al.'s proposed a (t; n) multi-secret sharing scheme. many storages and publicvalues required in chien's scheme. motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the lagrange interpolation formula for polynomials andcip...

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

The paper analyses the multiple assignment secret sharing scheme, presented at the GLOBECOM'87 Conference. It contains three technical comments and a contribution to extend the capabilities of Shamir scheme. First it is proved that the proposed multiple assignment secret sharing scheme is not perfect. In fact, the non-perfectness of the scheme is due to the non-perfectness of a certain type of ...

In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...

Secret sharing schemes are methods for distributing a secret among n participants in such a way that any qualified subsets of participants can recover the secret, and unqualified participants can not. In 1979, secret sharing schemes were first independently introduced by Blakley and Shamir. In 1987, Feldman proposed a verifiable secret sharing scheme based on Shamir’s Scheme, that every partici...

An efficient threshold scheme is proposed in this paper. It overcomes the weakness of Asmuth et al.’s scheme. The (r, n)-threshold scheme proposed below only takes O(r) operations to recover the shared secret while Shamir’s scheme takes O(rlogr) operations. We show that our scheme is perfect. Further, we also propose a method to generate a pairwise relatively prime integer set which satisfies t...