一类高效的动态门限秘密共享体制  

A New Dynamic Threshold Scheme with High Efficiency

作　　者：高峰修[1] 黄根勋[2] 李光松[1] 

机构地区：[1]解放军信息工程大学信息工程学院,河南郑州450002 [2]解放军信息工程大学理学院,河南郑州450002

出　　处：《通信技术》2007年第11期308-310,313,共4页Communications Technology

基　　金：国家自然科学基金资助项目(No.60673081)

摘　　要：将Shamir(k,n)-门限体制逆用,笔者构造了一类新的动态门限体制。该体制结构简单,易于实现。而且在系统更新时、删减成员时,仅需更新一些公开信息,因此效率更高。另外该方案可以有效的阻止来自系统内部和外部的攻击,因此提高了系统的实用性。同时该体制能够由每个成员自主选择子密钥,所以在应用上更加灵活方便。By using the inverse version of Shamir＇ s sharing scheme, a new dynamic threshold scheme is proposed The scheme has a simple structure as Shamir＇ s scheme. And when the secret is refreshed, or a participant is removed, it needs only refresh some public parameters, so it is more efficient. Furthermore, it is a verifiable secret sharing scheme. It helps counter the attacks both from outside and from inside, thus make the scheme more applicable. Because the participants in the scheme are able to select the shares by themselves, this makes the scheme more flexible in application.

关 键 词：门限体制 可验证的 动态 自主选取子密钥 

分 类 号：TN918[电子电信—通信与信息系统]