Multilevel threshold secret sharing based on the Chinese Remainder Theorem
L Harn, M Fuyou - Information processing letters, 2014 - Elsevier
The (t, n) threshold secret sharing schemes (SSs) were introduced by Shamir and Blakley
separately in 1979. Multilevel threshold secret sharing (MTSS) is a generalization of …
separately in 1979. Multilevel threshold secret sharing (MTSS) is a generalization of …
Ideal perfect multilevel threshold secret sharing scheme
Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal
and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme …
and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme …
[HTML][HTML] Tightly coupled multi-group threshold secret sharing based on Chinese Remainder Theorem
K Meng, F Miao, W Huang, Y Xiong - Discrete Applied Mathematics, 2019 - Elsevier
Abstract (t, n)-Threshold secret sharing ((t, n)-SS) scheme is a fundamental cryptographic
primitive. As a special (t, n)-SS, a Multi-Level threshold Secret Sharing scheme (MLSS) …
primitive. As a special (t, n)-SS, a Multi-Level threshold Secret Sharing scheme (MLSS) …
[PDF][PDF] Weighted Secret Sharing Based on the Chinese Remainder Theorem.
L Harn, F Miao - Int. J. Netw. Secur., 2014 - Citeseer
In a),(nt secret sharing scheme (SS), a dealer divides a secret into n shares in such a way
that (a) the secret can be recovered successfully with t or more than t shares, and (b) the …
that (a) the secret can be recovered successfully with t or more than t shares, and (b) the …
Constructing ideal secret sharing schemes based on Chinese remainder theorem
Y Ning, F Miao, W Huang, K Meng, Y Xiong… - … Conference on the …, 2018 - Springer
Abstract Since (t, n)-threshold secret sharing (SS) was initially proposed by Shamir and
Blakley separately in 1979, it has been widely used in many aspects. Later on, Asmuth and …
Blakley separately in 1979, it has been widely used in many aspects. Later on, Asmuth and …
A Fast (3,n)-Threshold Secret Sharing Scheme Using Exclusive-OR Operations
J Kurihara, S Kiyomoto, K Fukushima… - IEICE transactions on …, 2008 - search.ieice.org
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 …
required to make n shares and recover the secret from k shares. As a solution to this …
A New (k,n)-Threshold Secret Sharing Scheme and Its Extension
J Kurihara, S Kiyomoto, K Fukushima… - Information Security: 11th …, 2008 - Springer
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 …
computational cost is required to make n shares and recover the secret. As a solution to this …
Dynamic threshold secret reconstruction and its application to the threshold cryptography
Abstract Shamir's (t, n) secret sharing scheme (SS) is based on a univariate polynomial and
is the most cited SS in the literature. The secret in a (t, n) SS can be recovered either by …
is the most cited SS in the literature. The secret in a (t, n) SS can be recovered either by …
Weighted threshold secret sharing based on the Chinese remainder theorem
S Iftene, IC Boureanu - Scientific Annals of Cuza University, 2005 - infoscience.epfl.ch
A secret sharing scheme derives from a given secret certain shares (or shadows) which are
distributed to users. The secret can be recovered only by certain predetermined groups. In …
distributed to users. The secret can be recovered only by certain predetermined groups. In …
A secret sharing scheme based on (t, n) threshold and adversary structure
H Qin, Y Dai, Z Wang - International Journal of Information Security, 2009 - Springer
The existing secret sharing schemes cannot be applied directly if the threshold and the
adversary structures are both needed to meet. A secret sharing scheme which can meet the …
adversary structures are both needed to meet. A secret sharing scheme which can meet the …