摘要
该文给出了一个基于离散对数的动态(k,n)一门限方案,它具有下述特点:(1)每个成员的子密钥可无限制地多次使用;(2)能够确认欺骗者;(3)当某个成员的子密钥泄密时,系统只须为该成员重新分配子密钥而不必更改其它成员的子密钥;(4)系统可以很方便地增加或删除一个成员;(5)恢复系统密钥时,采用并行过程。
A dynamic (k,n)-threshold secret sharing scheme based on discrete logarithm is proposed in this paper. It can reconstruct the different system secrets for many times without any restriction. Any cheater can be checked out. When some participants' secret sharing values are revealed, they can be renewed without any effect on the others. It is convenient to add or to delete one or more participants. The system secret can be recovered with a parallel process.
出处
《电子与信息学报》
EI
CSCD
北大核心
2002年第2期276-279,共4页
Journal of Electronics & Information Technology
基金
黑龙江省科委资助
