作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (15): 141-142. doi: 10.3969/j.issn.1000-3428.2009.15.048

• 安全技术 • 上一篇    下一篇

可验证的(t, n)门限多重秘密共享方案

张艺林1,2,张建中1   

  1. (1. 陕西师范大学数学与信息科学学院,西安 710062;2. 陕西教育学院,西安 710061)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-08-05 发布日期:2009-08-05

Verifiable (t, n) Threshold Multi-secret Sharing Scheme

ZHANG Yi-lin1,2, ZHANG Jian-zhong1   

  1. (1. College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062; 2. Shaanxi Institute of Education, Xi’an 710061)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-08-05 Published:2009-08-05

摘要: Pang-Liu-Wang方案中的秘密份额由秘密分发者生成,因此需要通过安全信道传送给各参与者,并且在秘密重构过程中,各参与者不能验证其他人提供的伪份额的有效性。针对上述不足,提出一种改进的秘密共享方案。该方案中,各参与者的秘密份额由自己选择,无须秘密分发者向他们传送任何秘密信息,各参与者可以相互验证伪份额的有效性,且只需维护一个秘密份额即可一次共享多个秘密或多次共享秘密。

关键词: 秘密共享, 门限方案, 多重秘密共享

Abstract: In Pang-Liu-Wang scheme, the dealer chooses and delivers secret information to each participant, so a secure channel between them is needed. And in recovery phase, each participant can not check whether another participant provides the true information or not. Aiming at such shortcomings, this paper proposes an improved secret sharing scheme. Each participant selects his secret shadow by himself. Each cooperative participant can check pseudo-shadow others have is true or not. Each participant shares many secrets one time with other participants by holding one shadow even many times.

Key words: secret sharing, threshold scheme, multi-secret sharing

中图分类号: