ABSTRACT A (t, n) secret sharing scheme (SS) enables a dealer to divide a secret into n
shares in such a way that (i) the secret can be recovered successfully with t or more than t …

Verifiable secret sharing (VSS) has been extensively used as a cryptographic tool in many
applications of information security in recent years. A VSS enables a dealer to divide a …

Threshold secret sharing (SS), also denoted as (t, n) SS, has been used extensively in the
area of information security, such as for group authentication, cloud storage schemes …

It is not always in the best interests to rely on an individual to have control of entire sensitive
information. This has led to the need for secret sharing schemes, which divide secret (key) …

In this paper, we investigate how to achieve verifiable secret sharing (VSS) schemes by
using the Chinese Remainder Theorem (CRT). We first show that two schemes proposed …

A (t, n) secret sharing divides a secret into n shares in such a way that any t or more than t
shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In …

In Shamir's (t, n) threshold secret sharing scheme, one secret s is divided into n shares by a
dealer and all shares are shared among n shareholders, such that knowing t or more than t …

This paper proposes a (t, n)–threshold verifiable secret sharing scheme with changeable
parameters based on a trapdoor one-way function. This scheme consists of a generation …

In Shamir's (t, n) secret sharing (SS) scheme, the secret s is divided into n shares by a dealer
and is shared among n shareholders in such a way that any t or more than t shares can …

Recently, Harn and Lin introduced a notion of strong t-consistency of a (t, n) secret sharing
scheme and proposed a strong (n, t, n) verifiable secret sharing (VSS). In this paper, we …