%0 Journal Article %A WANG Baowen %A WU Xiaoliang %A LI Ruiting %A LIU Weilong %T New verifiable multi-secret sharing scheme %D 2011 %R 10.3778/j.issn.1002-8331.2011.04.025 %J Computer Engineering and Applications %P 90-92 %V 47 %N 4 %X Existing scheme has the defects of complicated construction and mass calculation.Aiming at these flaws,this paper proposes a new verifiable multi-secret sharing scheme based on the Chinese Remainder Theorem.This scheme can realize the repeat use of the secret shadow,pack the multi-secret into single secret through using the Chinese Remainder Theorem,avoid using bivariant function,also leave out the use of the security channel.The realization of the algorithm is based on the intractability of the Discrete Logarithm and RSA cryptosystem.So it is an efficient and safe multi-secret sharing scheme through analysis.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2011.04.025