%0 Journal Article
%A ZHANG Benhui1
%A TANG Yuansheng2
%T Two perfect threshold changeable multi-secret sharing schemes
%D 2017
%R 10.3778/j.issn.1002-8331.1608-0356
%J Computer Engineering and Applications
%P 24-27
%V 53
%N 5
%X The threshold [t] can be changed into [t>t] in [t→t,n] threshold changeable schemes, which can increase the difficulty for attackers to attack the schemes. Based on Lagrange interpolation polynomial, two perfect threshold changeable multi-secret sharing schemes: [t→t+1,n] threshold changeable scheme [Π,Π] and [t→t+v-1,n] threshold changeable scheme [Π,Π] are proposed. It is shown that [Π] is a [t-1,t+1,n] ramp secret sharing scheme, [Π] is an optimal [t-1,t+v-1,n] ramp secret sharing scheme and [Π,Π] is an optimal [t→t+v-1,n] threshold changeable scheme.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1608-0356