摘要
由于采用了基于状态树的(t,n)秘密共享算法,因此该方案具有计算量小,效率高的特性。不仅有效地解决了“一次监听,永久监听”问题,而且在监听阶段,监听机构能够确切地知道门限密钥托管方案中哪些托管代理伪造或篡改子密钥。同时,在各托管代理中有一个或几个托管代理不愿合作或无法合作时,监听机构仍能很容易地重构出会话密钥。
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 solves the problem of＂once monitor,monitor forever＂ , but also monitor agency can exactly decide 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.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第4期146-149,共4页
Computer Engineering and Applications
基金
云南省自然科学基金(the Natural Science Foundation of Yunnan Province of China under Grant No.2003F0016M)
云南省网络信息技术专项基金资助项目(2004IT11)。
