Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (4): 90-92.DOI: 10.3778/j.issn.1002-8331.2011.04.025

• 网络、通信、安全 • Previous Articles     Next Articles

New verifiable multi-secret sharing scheme

WANG Baowen,WU Xiaoliang,LI Ruiting,LIU Weilong   

  1. School of Information Science and Engineering,Yanshan University,Qinhuangdao,Hebei 066004,China
  • Received:2009-05-25 Revised:2009-08-18 Online:2011-02-01 Published:2011-02-01
  • Contact: WANG Baowen



  1. 燕山大学 信息科学与工程学院,河北 秦皇岛 066004
  • 通讯作者: 王宝文

Abstract: Existing scheme has the defects of complicated construction and mass calculation.Aiming at these flaws,this paper proposes a new verifiable multi-secret sharing scheme based on the Chinese Remainder Theorem.This scheme can realize the repeat use of the secret shadow,pack the multi-secret into single secret through using the Chinese Remainder Theorem,avoid using bivariant function,also leave out the use of the security channel.The realization of the algorithm is based on the intractability of the Discrete Logarithm and RSA cryptosystem.So it is an efficient and safe multi-secret sharing scheme through analysis.

Key words: multi-secret sharing, Chinese remainder theorem, RSA, discrete logarithm

摘要: 针对现有方案构造复杂、计算量大的缺陷,提出一个基于中国剩余定理的可验证多秘密分享方案,该方案可以实现秘密份额的重复使用,利用中国剩余定理把多个秘密打包为单个秘密,避免了双变量函数的使用,实现起来更加简便且算法的实现基于离散对数难解性和RSA密码体制,通过分析有较高的安全性和实用性。

关键词: 多秘密分享, 中国剩余定理, RSA算法, 离散对数

CLC Number: