| 可选子密钥的秘密共享方案 |
| |
| 引用本文： | 申一.可选子密钥的秘密共享方案[J].哈尔滨师范大学自然科学学报,2006,22(1):54-57. |
| |
| 作者姓名： | 申一 |
| |
| 作者单位： | 哈尔滨师范大学;黑龙江省教育学院;哈尔滨师范大学 |
| |
| 基金项目： | 黑龙江省博士后科研启动基金
,
黑龙江省科技厅科研项目 |
| |
| 摘 要： | 1979年,Sham ir和B lakley分别独立地提出了密钥分散管理的思想后,人们又提出了很多方案来实现它.目前已有的秘密共享方案多是由系统为每个成员分配子密钥,这给实际应用带了许多不便.本文给出了一个可以重复使用子密钥并且可以由子密钥持有者自主选择子密钥的(k,n)-门限方案.
|
| 关 键 词： | 秘密共享 (k n)-门限方案 |
| 收稿时间： | 2005-09-12 |
| 修稿时间： | 2005年9月12日 |
SELF-SELECTING SHARES SECRET SHARING SCHEMES |
| |
| Shen Yidi,Liu Huanping.SELF-SELECTING SHARES SECRET SHARING SCHEMES[J].Natural Science Journal of Harbin Normal University,2006,22(1):54-57. |
| |
| Authors: | Shen Yidi Liu Huanping |
| |
| Institution: | 1.Harbin Normal University,Heilongjiang Education College;2.Harbin Normal University |
| |
| Abstract: | Threshold scheme based on finite geometries and polynomial interpolations were introduced independently by Blakley and Shamir 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. |
| |
| Keywords: | Secret sharing scheme (k n)-secret sharing scheme |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
