| 基于RSA与DLP可证实的多秘密分享方案 |
| |
| 引用本文： | 甘元驹,谢仕义,沈玉利,周美娟.基于RSA与DLP可证实的多秘密分享方案[J].小型微型计算机系统,2006,27(3):455-457. |
| |
| 作者姓名： | 甘元驹 谢仕义 沈玉利 周美娟 |
| |
| 作者单位： | 广东海洋大学,信息学院,广东,湛江,524088 |
| |
| 基金项目： | 国家自然科学基金项目（60173041）资助. |
| |
| 摘 要： | 已有的多秘密分享方案不能有效解决秘密管理者和秘密成员的欺诈，以及子秘密恢复时计算量大等问题，在基于离散对数和RSA因式分解问题上提出了一种更加有效的解决方案．该方案提供了有效解决秘密管理者欺骗和成员欺骗的方法，与其它已有的方案相比，此方案的优点在于计算量低和子秘密恢复时采用了并行算法．
|
| 关 键 词： | 密码学 秘密分享 因式分解问题 离散对数 欺骗 |
| 文章编号： | 1000-1220（2006）03-0455-03 |
| 收稿时间： | 11 22 2004 12:00AM |
| 修稿时间： | 2004-11-22 |
Verifiable Multi-Secret Sharing Scheme Based on RSA & DLP |
| |
| GAN Yuan-ju,XIE Shi-yi,SHEN Yu-li,ZHOU Mei-juan.Verifiable Multi-Secret Sharing Scheme Based on RSA & DLP[J].Mini-micro Systems,2006,27(3):455-457. |
| |
| Authors: | GAN Yuan-ju XIE Shi-yi SHEN Yu-li ZHOU Mei-juan |
| |
| Affiliation: | School of Information, Guangdong Ocean University, Zhanjiang 524088, China |
| |
| Abstract: | 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. |
| |
| Keywords: | cryptography secret sharing factorization problem discrete logarithm cheating |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
