适用于任意存取结构的动态多秘密共享方案  

Dynamic Multi-secret Sharing Scheme for Arbitrary Access Structure

作　　者：李婧[1] 李志慧[1] 吴星星[1] 

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

出　　处：《计算机工程》2013年第12期144-147,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(11271237);陕西师范大学研究生培养创新基金资助项目(2012CXS037)

摘　　要：为满足一般存取结构的多秘密共享方案在实际应用中的可验证性和动态性需求,提出一种适用于任意存取结构的动态可验证多秘密共享方案,其中每个参与者各自选取秘密份额,采用RSA公钥密码体制将该份额通过公开信道发送给分发者。同时基于双变量单向函数为每个参与者分配伪秘密份额,利用双变量单向函数之间的异或运算设计秘密分发算法及重构算法。分析结果表明,该方案在秘密重构阶段参与者只需要出示其伪份额即可恢复主秘密,无须泄漏真正的秘密份额,具有防欺诈性;秘密份额的分发可以通过公开信道实现,减少了方案的实施代价。In order to realize verifiability and dynamic property of practical requirements for multi-secret sharing schemes with general access structures, this paper presents a dynamic multi-secret sharing scheme for arbitrary access structure, where each participant selects his own secret share, and sends it to the dealer without secure channel based on RSA cryptosystem. Meanwhile, on the basis of two-variable one-way function, pseudo secret share of each participant is calculated, and secret distributed algorithm and reconstructed algorithm are designed. Analysis result shows that in the reconstruction phase, each participant has only to present his pseudo-secret share to recover the secret without showing his real share, this scheme has the anti-fraud property, and it realizes the distribution of shares through public channel, which can reduce the cost of scheme.

关 键 词：多秘密共享 存取结构 双变量单向函数 可验证性 RSA密码体制 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]