中文摘要：

最近，Lin和Wu提出了一个防欺诈多秘共享方案。在该方案中，他们声称该方案是基于求解大整数分解和离散对数问题是不可行的。本文对Lin-Wu方案进行了分析，指出他们的方案有两个缺点：一．它不能抵抗来自内部参加者的攻击，二．它的安全性只相当于求解离散对数问题。针对该方案中存在的缺点，我们对其进行了改进。改进后的方案不仅可以抵抗来自内部参加者的攻击，而且使它的安全性真正建立在大整数分解和求解离散对数问题的双重困难数学问题上。

英文摘要：

Recently, Lin and Wu proposed a （4, n）-threshold verifiable multi-secret sharing scheme. They claimed that the security of their scheme is based on the intractability of the factor- ization and the discrete logarithm modulo a composite problems. In this paper, we analysis the security of Lin-Wu＇s scheme, and points out that their claim about the security of their scheme is false and their scheme does not counteract cheating by a participant. We improve Lin-Wu~s scheme to make the security really base on the intractability of factorization and discrete logarithm modulo a composite problems, and our improved scheme can withstand cheating by a participant.