基于因式分解的防止欺诈的多秘密分享方案

针对现有的多秘密分享方案不能同时有效解决分发者和分享者欺诈,以及子秘密恢复时计算量大等问题,在基于求解大整数因式分解的难题上,提出了一种有效的解决方案。该方案不仅有效地解决了分发者和分享者欺诈问题,而且每个分享者只需拥有一个秘密份额就能和其它分享者分享多个秘密信息。与其它已有的方案相比,方案的优点在于计算量低和子秘密恢复时采用了并行算法。

A Cheat-proof Multi-secret Sharing Scheme Based on Factorization

Most previous multi-secret sharing schemes have some problems in that those schemes cannot deter the cheating of both the dealer and shadowholders efficiently and the computation of a secret recovery is overhead. An efficient solving scheme based on the difficulty of computing the large-integer factorization problem has been proposed. This new scheme not only solves the fraud efficiently of both the dealer and any participants but also helps each participant to share multiple secrets with other participants by holding only one shadow. Compared with other schemes, the proposed scheme has the advantages of lower computation and parallel reconstruction in a secret recovery phase.