一个高效的广义动态多秘密分享机制  

Efficient Generalized Dynamic Multiple Secrets Sharing Scheme

作　　者：杜红珍[1] 张建中[1] 

机构地区：[1]陕西师范大学数学与信息科学学院

出　　处：《计算机应用研究》2006年第7期104-105,128,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(10271069);陕西省自然科学基础研究计划资助项目(2004A14);陕西师范大学重点科研项目资助课题

摘　　要：针对Yeun秘密分享方案[7,8]的不足,给出了一个基于单向函数的广义动态多秘密分享方案。新方案可适用于任意接入结构,并对Yeun方案的不足进行了改进,它可以及时检测出分享成员中的所有欺诈者,解决了秘密更新与子密复用问题,且可以很方便地增删系统成员。尤其方案所需计算量与计算复杂度均比Yeun方案大大减小,因而高效且实用,它将在密钥托管、电子商务中得到广泛的应用。A Generalized dynamic multiple Secrets sharing scheme ba,zed on one-way function is proposed in this paper. It is applicable to arbitrary access structures and eliminates the weaknesses of Yeun scheme. It can easily identify the cheaters of all shareholders, effectively solve the renewal and reuse problems, easily and freely accept a new participant or fire a participant. Compared with Yeun scheme ,the amount of computation and the computational complexity are reduced. So the scheme is relatively more efficient and practical. It will he widely applied in distributed key escrow and electronic commerce.

关 键 词：秘密分享 接入结构 单向函数 

分 类 号：TN918[电子电信—通信与信息系统]