点击次数：

论文类型：期刊论文

第一作者：Yuan, Lifeng

合写作者：Li, Mingchu,Guo, Cheng,Choo, Kim-Kwang Raymond,Ren, Yizhi

发表时间：2016-10-28

发表刊物：PLOS ONE

收录刊物：SCIE、PubMed、Scopus

卷号：11

期号：10

页面范围：e0165512

ISSN号：1932-6203

摘要：After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed ( t -> t', n) and ({t(1), t(2), ..., t(N)}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely.