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 ...

We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remains: it is not possible to forge signatures relating to the past. In this paper, we describe the first forward-secure threshold signature schemes whose parameters (other than signing or verifying time) do not vary in len...

In secret sharing scheme, the master secret and all the private shares (which are distributed by the dealer to the shareholders) are the two secrets which are to be maintained confidentially. In all the secret sharing schemes proposed till date, private shares are reused to reconstruct the master secret. But we proposed a new way of Proactive Secret Sharing Scheme in which, instead of renewing ...

Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A69(04)052319], we propose a (n, n)-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information recei...

In this paper there are presented algorithms for multilevel hierarchical threshold secret sharing schemes based on the interpolation of Hermite type, which use either traditional Shamir’s keys or polynomial and orthogonal polynomial keys. These algorithms enable to compute the probability of authenticity of shares during the process of recovering the keys. In addition, two models of secret shar...

This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using the relative dimension/length profile (RDLP) and the relative generalized Hamming weight (RGHW). We first describe the equivocation Δm of the secret vector s = [s1, . . . ,sl ] given m shares in terms of the RDLP of linear codes. We also characterize two thresholds t1 and t2 in the secret sharing ...

0167-8655/$ see front matter 2012 Published by http://dx.doi.org/10.1016/j.patrec.2012.04.010 ⇑ Corresponding author. Address: Department of Computer Science, Feng Chia University, No. 100 We 40724, Taiwan. Tel.: +886 4 24517250x3790; fax: +8 E-mail addresses: [email protected] (C. Guo Chang). In this paper, we consider the problem of secret image sharing in groups with multi-threshold access s...

Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique ...

Password-protected secret sharing (PPSS) schemes allow a user to publicly share its high-entropy secret across different servers and to later recover it by interacting with some of these servers using only his password without requiring any authenticated data. In particular, this secret will remain safe as long as not too many servers get corrupted. However, servers are not always reliable and ...