摘要:
如何将密钥信息分配给n个被授权的单位(记为：S1, S2, , Sn), 每一个被授权单位Si(#em/em#=1, 2, , n)有qi个被授权人, 使得每一个被授权人所得到的密钥信息与该授权人所在的单位的任何其他被授权人所得到的密钥信息是一致的, 而任意K个被授权人所得到的密钥信息, 若至少包含每一个被授权单位中的至少一个被授权人的密钥信息时, 能够恢复完整的密钥信息, 其他情形时, 无法完全恢复密钥信息, 这种需要经常会遇到. 本文利用代数半群理论, 绐出了一种能实现这种密钥分享的方案.
Abstract:
How to distribute a secret key information to n authorized departments(denoted as: S1, S2Sn, respectively).For every autherized department Si(#em/em#=1, 2,, n), there are qi authorized persons,and every authorized person has the same secret key information as that of any other authorized persons in the same authoried department.The secret key information can be reconstrueted Completely from the secret key information of any k authorized persons， if there is at least one authorized person included for every authorized department.But other cases,the secret key information cannot be reconstructed completely.In this paper,based on the algebraic semigroup theory,a secret key sharing scheme is proposed,which can satisfy the demand.
下载:
