文献类型：期刊文献

中文题名：一种有效的可验证的门限多秘密分享方案

英文题名：Efficient and verifiable threshold multi-secret sharing scheme

作者：甘元驹[1];彭银桥[1];沈玉利[1];施荣华[2]

机构：[1]湛江海洋大学信息学院,广东湛江524088;[2]中南大学信息工程学院,湖南长沙410075

年份：2005

卷号：26

期号：8

起止页码：1994

中文期刊名：计算机工程与设计

外文期刊名：Computer Engineering and Design

收录：CSTPCD、、北大核心2004、CSCD_E2011_2012、北大核心、CSCD

基金：国家自然科学基金项目(60173041);广东省科技基金项目(20041190067)

语种：中文

中文关键词：密码学;秘密共享;因式分解;离散对数;欺骗

外文关键词：cryptography; secret sharing; factorization; discrete logarithm; cheating

中文摘要：针对多数秘密共享方案不能同时防止秘密管理者和秘密成员的欺骗,以及子秘密重构时计算量大等问题,提出了一种安全有效的解决方案。在该方案中,每个分享者只需拥有一个秘密影子就可以和其它分享者共享多个秘密信息,此外,方案提供了有效抵御秘密管理者欺骗和成员欺骗的解决方法。方案的安全性是基于求离散对数和RSA大整数因式分解的困难性。与其它已有的方案相比,此方案的优点在于计算量低和子秘密重构时采用了并行算法。

外文摘要：Most previous secret sharing schemes have some problems in which the schemes can not deter the cheating of the dealer and secret shadowholders simultaneously, and the computation in a secret recovery is overhead. A secure and efficient solving scheme was proposed. Each participant can share many secrets with other participants by holding only one shadow in the proposed scheme. This new scheme provides efficient solutions against cheating of the dealer and cheating of any participant. The security of the proposed scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number and the factorization problem of a large integer. Compared with the other existing schemes, the proposed scheme has the advantages of lower computation and the parallel reconstruction in a secret recovery phase.