| 基于可恢复模式的(v,r,n)门限改进方案 |
| |
| 引用本文： | 谢柯,侯整风,李健. 基于可恢复模式的(v,r,n)门限改进方案[J]. 合肥工业大学学报(自然科学版), 2006, 29(5): 540-543 |
| |
| 作者姓名： | 谢柯 侯整风 李健 |
| |
| 作者单位： | 合肥工业大学,计算机与信息学院,安徽,合肥,230009;合肥工业大学,计算机与信息学院,安徽,合肥,230009;合肥工业大学,计算机与信息学院,安徽,合肥,230009 |
| |
| 摘 要： | 文章提出了一个具体完整的、实践性强的(v,r,n)门限改进方案,在保证方案的效率及安全性的基础上,通过二次拉格朗日插值及系统中心补发子密钥的方法,重点加强并实现了在出现欺骗者的情况下,系统的自我保护(即所谓的自恢复功能),且门限的次数没有降低;同时给出了与V-fairness方案的比较。
|
| 关 键 词： | 门限 拉格朗日插值 自恢复 |
| 文章编号： | 1003-5060(2006)05-0540-04 |
| 修稿时间： | 2005-05-10 |
Improvement of the (v,r,n)threshold scheme based on a recoverable mode |
| |
| XIE Ke,HOU Zheng-feng,LI Jian. Improvement of the (v,r,n)threshold scheme based on a recoverable mode[J]. Journal of Hefei University of Technology(Natural Science), 2006, 29(5): 540-543 |
| |
| Authors: | XIE Ke HOU Zheng-feng LI Jian |
| |
| Abstract: | In this paper,an improved(v,r,n)threshold scheme that is complete and practicable is proposed.In view of guaranteeing the efficiency and security of this scheme,the Lagrange interpolation polynomial is applied twice and the SA reissues some sub-secrets(shadows) to the t participants,thus the system's function of self protection is improved without reducing the degrees of the threshold.In the cases that cheaters appear,the system can recover itself.A comparison between this scheme and the V-fairness scheme is also made. |
| |
| Keywords: | threshold Lagrange interpolation polynomial selfrecovery |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
