中文摘要：

基于单向函数和大整数因子分解问题,提出了一个动态有效的（t,n）门限多秘密分享方案。通过此分享方式,秘密分发者可以给出任一待分享秘密的集合,而每个成员只需持有惟一可以重复使用的秘密份额;它能同时有效地检测出分发者和分享者的欺诈行为,解决秘密恢复时计算量大等问题。对于本方案来说,新成员的加入是容易的;为了在不影响其他任何成员的情况下删除某个或某些成员,引入了一个新奇的方法。

英文摘要：

Based on a one-way function and the large-integer factorization problem, proposed an efficient and dynamic （t, n） threshold multi-secret sharing scheme. By this scheme, the dealer could arbitrarily give any set of multiple secrets to be kept by every participant; meanwhile, it could efficiently prevent both dealer cheating and other participants cheating, and the computation of a secret recovery was overhead. Considering the scheme, it was easy for new participants to join. However, the revocation schemes were always difficult. A novel revocation scheme is used, which needs little computational cost at the user end, without affecting any of the other performance parameters.