计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (28): 122-124.
• 网络、通信与安全 • 上一篇 下一篇
王 锋,张建中
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
WANG Feng,ZHANG Jian-zhong
Received:
Revised:
Online:
Published:
Contact:
摘要: 基于Shamir门限秘密共享方案,提出了一个可验证的为新个体分配子秘密的算法。该算法具有无需信任中心,无需改动原有子秘密,仅需(3t+2)次广播,t个老成员合作(t为门限)等优点。经过分析与验证,该算法是正确的,与现有的协议相比,其安全性高,性能好,具有良好的可靠性和可用性。
关键词: 秘密共享, 新个体, 验证, 信任中心
Abstract: This paper proposes a new verifiable secret redistribution protocol according to threshold secret sharing schemes that create n shares of the secret for n shares of old participants,the protocol only requires t(t is the threshold) participants’ cooperation and(3t+2) times broadcasting to generate and to distribute the new share.The validity of the proposed protocol has a higher security and is easier in key management and better in reliability and usability.
Key words: secret sharing, new member, verify, trusted center
王 锋,张建中. 一种新的可验证的秘密共享新个体加入协议[J]. 计算机工程与应用, 2007, 43(28): 122-124.
WANG Feng,ZHANG Jian-zhong. New verifiable protocol for member expansion in secret sharing schemes[J]. Computer Engineering and Applications, 2007, 43(28): 122-124.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I28/122