计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (4): 131-133.

• 网络、通信与安全 • 上一篇    下一篇

一种新的可验证的多秘密分享方案

赵建杰 张建中   

  1. 陕西师范大学 安徽农业大学工学院
  • 收稿日期:2006-06-06 修回日期:1900-01-01 出版日期:2007-02-01 发布日期:2007-02-01
  • 通讯作者: 赵建杰

A Novel Verifiable Multi-secret Sharing Scheme

  • Received:2006-06-06 Revised:1900-01-01 Online:2007-02-01 Published:2007-02-01

摘要: 2005年,Q. Li, Z. Wang, X. Mu 等人[Q. Li, Z. Wang, X. Mu, S. Sun. A non-interactive modular verifiable secret sharing scheme. Communications, Circuits and System, 2005(1) 84-87]基于Asmuth等人的模可验证秘密分享(modular verifiable secret sharing)提出了一种新的可验证的秘密分享方案。但文章中秘密分享的算法并不实用;此方案也不是多多秘密分享方案。本文提出了一个新的可验证的多秘密分享方案。该方案可以同时恢复多个秘密,秘密份额可以重用。

Abstract: In 2005, Q. Li, Z. Wang, X. Mu et. al.[ Q. Li, Z. Wang, X. Mu, S. Sun. A non-interactive modular verifiable secret sharing scheme. Communications, Circuits and System, 2005(1) 84-87] proposed a new verifiable secret sharing scheme based on the Asmuth et al.’s modular verifiable secret sharing scheme. But the algorithm to share the secret is not practical and the scheme is not a multi-secret sharing. In this paper, we shall propose a novel verifiable multi-secret sharing scheme by using the improved verification algorithm. The scheme can recover several secrets parallelly and the secret shadows can be reused.