可选子密钥的秘密共享方案  

SELF-SELECTING SHARES SECRET SHARING SCHEMES

作　　者：申一頔[1] 刘焕平[1] 

机构地区：[1]哈尔滨师范大学

出　　处：《哈尔滨师范大学自然科学学报》2006年第1期54-57,共4页Natural Science Journal of Harbin Normal University

基　　金：黑龙江省博士后启动基金(LRB-KY01043);黑龙江省科委基金(G99A10-3)资助

摘　　要：1979年,Sham ir和B lakley分别独立地提出了密钥分散管理的思想后,人们又提出了很多方案来实现它.目前已有的秘密共享方案多是由系统为每个成员分配子密钥,这给实际应用带了许多不便.本文给出了一个可以重复使用子密钥并且可以由子密钥持有者自主选择子密钥的(k,n)-门限方案.Threshold scheme based on finite geometries and polynomial interpolations were introduced independently by Blakley and Sharnir in 1979. Since then, many constructions have been given for such cryptographic schemes. In the common sharing schemes, the shares will be generated by the dealer and distributed to every participant through a secret channel. But this method will occur many drawbacks. We pose a new （k, n） - secretsharing scheme here, it makes every participant not get one key by the dealer distribution through secure passage, but self - select one.

关 键 词：秘密共享 (k n)-门限方案 密钥分散管理 子密钥 

分 类 号：TN918.1[电子电信—通信与信息系统] TP311.13[电子电信—信息与通信工程]