摘要:
如何將密鑰信息分配給n個(gè)被授權(quán)的單位(記為：S1, S2, , Sn), 每一個(gè)被授權(quán)單位Si(#em/em#=1, 2, , n)有qi個(gè)被授權(quán)人, 使得每一個(gè)被授權(quán)人所得到的密鑰信息與該授權(quán)人所在的單位的任何其他被授權(quán)人所得到的密鑰信息是一致的, 而任意K個(gè)被授權(quán)人所得到的密鑰信息, 若至少包含每一個(gè)被授權(quán)單位中的至少一個(gè)被授權(quán)人的密鑰信息時(shí), 能夠恢復(fù)完整的密鑰信息, 其他情形時(shí), 無(wú)法完全恢復(fù)密鑰信息, 這種需要經(jīng)常會(huì)遇到. 本文利用代數(shù)半群理論, 紿出了一種能實(shí)現(xiàn)這種密鑰分享的方案.
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.
下載:
