防欺诈的广义多秘密分享方案  

A General Multi-Secret Sharing Scheme for Cheat-Proof

作　　者：甘元驹[1] 谢仕义[1] 付东洋[1] 李小立[1] 

机构地区：[1]广东海洋大学信息学院,广东湛江524088

出　　处：《电子科技大学学报》2008年第1期68-69,80,共3页Journal of University of Electronic Science and Technology of China

基　　金：广东海洋大学自然科学基金(2006032);广东省科技基金(2006B501018)

摘　　要：针对现有的门限多秘密分享方案不能有效地解决秘密成员的动态增加或删除问题,在基于离散对数与单向Hash函数求逆难题,提出了一种具有广义接入结构的高效的多秘密分享方案。该方案可以高效地检测秘密管理者与分享者的欺诈行为;秘密管理者每增加一个新的共享秘密,只需要公开两个参数;子秘密恢复时,采用了并行算法;可高效、动态地增加新成员或删除旧成员,无需重新计算其他成员的秘密份额。The most present threshold multi-secret sharing schemes cannot efficiently solve the problem that a participant is dynamic added or deleted. In this study, an efficient multi-secret sharing scheme is designed with general access structure based on the intractability of reversing the one-way Hash function and solving the discrete logarithm problem. The proposed scheme has the following properties： cheating of the dealer or any participant can be detected efficiently; two public parameters of a new secret would be published by the dealer; the participants reconstruct a secret with parallel procedure in a secret recovery phase; and the shadows of other participants would not change when the system accepts a new participant or fires an old participant.

关 键 词：密码学 离散对数 单向HASH函数 秘密分享 

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