Abstract: This paper proposes a new general verifiable secret sharing scheme based on blind signature, in which no secure channel is needed. It cuts the cost of transition, the security is based on discrete logarithm and one-way function. It is more computable and low cost. In this scheme, the sub-secret of participant can be used reiterative. It can solve the mutile-secret sharing problem.

Key words: verifiable secret sharing, general secret sharing, blind signature

摘要： 基于可恢复性的盲签名提出一个可验证的广义秘密共享方案。该方案无需安全的信道，可降低通信代价，其安全性基于离散对数问题和单向函数，与以往的方案相比计算更加简单，通信环境要求更低。该方案中参与者的子秘密可重复使用，能解决现实生活中的多秘密共享问题。

关键词: 可验证秘密共享, 广义秘密共享, 盲签名

CLC Number: 

• TP309