摘要
董攀等人基于Shamir的(t,n)门限方案提出了一种为新个体分配秘密份额的方案。该方案具有无需信任中心,无需改动其他人秘密份额等优点。然而该方案存在一个缺陷,导致任意成员都可以求出其他成员的子密钥,进而重构群组密钥。论文对此进行了密码分析,并给出了详细的攻击方法。
Dong et al. have proposed a new secret redistribution protocol based on Shamir's (t,n) threshold scheme.lt has some advantages.For example,it doesn't need a trusted center,the secret sharing doesn't need to change.However,the scheme has a disadvantage.Any of the dishonest members can get other member's secret share and reconstruct the secret key of the group.In this paper,the cryptanalysis of Dong et al.'s scheme is given.And the detailed attack is presented.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第21期90-91,共2页
Computer Engineering and Applications
基金
国家自然科学基金资助项目(编号:60373026)
山东省自然科学基金资助项目(编号:Y2003G02)
关键词
协议
秘密共享
门限
新个体
protocol,secret sharing,threshold,new member