In Shamir's (k, n)-threshold secret sharing scheme [1], a heavy computational cost is
required to make n shares and recover the secret from k shares. As a solution to this …

In Shamir's (k, n)-threshold secret sharing scheme (threshold scheme)[1], a heavy
computational cost is required to make n shares and recover the secret from k shares. As a …

In Shamir's (k, n)-threshold secret sharing scheme (threshold scheme), a heavy
computational cost is required to make n shares and recover the secret. As a solution to this …

Shamir's (k, n)-threshold secret sharing scheme (threshold scheme) has two problems: a
heavy computational cost is required to make shares and recover the secret, and a large …

Fast (k, n)-threshold secret sharing schemes with exclusive-OR operations have proposed
by Kurihara et al. and Fujii et al. independently. Their method are ideal that share size is …

Threshold secret sharing is concerned with the splitting of a secret into n shares and
distributing them to some persons without revealing its information. Any t≤ n persons …

We propose a new XOR-based (k, n) threshold secret SSS, where the secret is a binary
string and only XOR operations are used to make shares and recover the secret. Moreover …

A general (t, n) secret sharing (SS) scheme with fixed threshold allows a secret to be shared
without considering the time dynamic nature of the security environment. In this paper, we …

Most of secret sharing schemes have to be computed in a Galois field, such as Shamir's
scheme, which have relatively heavy computational cost. Kurihara et al. recently proposed a …

In the setting of secret sharing, a group of parties wish to run a protocol for recovering the
secret when they input their shares. The security requirement include privacy, correctness …