基于RSA与DLP可证实的多秘密分享方案  

Verifiable Multi-Secret Sharing Scheme Based on RSA & DLP

作　　者：甘元驹[1] 谢仕义[1] 沈玉利[1] 周美娟[1] 

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

出　　处：《小型微型计算机系统》2006年第3期455-457,共3页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60173041)资助.

摘　　要：已有的多秘密分享方案不能有效解决秘密管理者和秘密成员的欺诈,以及子秘密恢复时计算量大等问题,在基于离散对数和RSA因式分解问题上提出了一种更加有效的解决方案.该方案提供了有效解决秘密管理者欺骗和成员欺骗的方法,与其它已有的方案相比,此方案的优点在于计算量低和子秘密恢复时采用了并行算法.Most previous secret sharing schemes have some problems in that those schemes can not deter the cheating of the dealer and secret shadowholders simultaneously, and the computation of a secret recovery is overhead. Based on the difficulty of computing the Discrete Logarithm Problem （DLP） and the RSA factorization problem of a large integer, a more efficient solving scheme has been proposed. This new scheme provides efficient solutions against cheating of the dealer and cheating of any participant. Compared with the other existing schemes, the proposed scheme has the advantages of lower computation and the parallel reconstruction in a secret recovery phase.

关 键 词：密码学 秘密分享 因式分解问题 离散对数 欺骗 

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