Open AccessNovel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation
Author(s) -
Lifeng Yuan,
Mingchu Li,
Cheng Guo,
KimKwang Raymond Choo,
Yi Ren
Publication year - 2016
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0165512
Subject(s) - secret sharing , computer science , secure multi party computation , homomorphic secret sharing , theoretical computer science , adversary , verifiable secret sharing , polynomial interpolation , shamir's secret sharing , cryptography , scheme (mathematics) , collusion , interpolation (computer graphics) , computer security , polynomial , mathematics , linear interpolation , artificial intelligence , set (abstract data type) , image (mathematics) , pattern recognition (psychology) , mathematical analysis , microeconomics , economics , programming language
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.