计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (4): 146-149.
• 网络、通信与安全 • 上一篇 下一篇
张春生 姚绍文 张险峰
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
Received:
Revised:
Online:
Published:
摘要： 由于采用了基于状态树的(t,n)秘密共享算法，因此该方案具有计算量小，效率高的特性。不仅有效地解决了“一次监听,永久监听”问题，而且在监听阶段，监听机构能够确切地知道门限密钥托管方案中哪些托管代理伪造或篡改子密钥。同时，在各托管代理中有一个或几个托管代理不愿合作或无法合作时，监听机构仍能很容易地重构出会话密钥。
关键词: ECC, 秘密共享, 状态树, 密钥托管, 托管代理, 监听
Abstract: Since this secret sharing scheme is based on a status-tree, it holds characteristic with the more efficiency and smaller computing. The proposed scheme not only solved the problem of “once monitor, monitor forever”, but also monitor agency can exactly decided which escrow agency forges or tampers secret shadow during monitor procedure. At the same time, monitor agency can easily reconstruct session key when an escrow agency or a few agencies is not cooperating.
Key words: ECC, secret sharing, status-tree, key escrow, escrow agent, monitoring
张春生 姚绍文 张险峰. 基于状态树的(t,n)门限密钥托管方案[J]. 计算机工程与应用, 2007, 43(4): 146-149.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I4/146
