基于中国剩余定理的无可信中心可验证秘密共享研究  

Research on Verifiable Secret Sharing Without Trusted Center Based on Chinese Remainder Theorem

作　　者：杨阳[1] 朱晓玲[1] 丁凉[1] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009

出　　处：《计算机工程》2015年第2期122-128,共7页Computer Engineering

基　　金：广东省教育部产学研结合基金资助项目(2008090200049)

摘　　要：基于中国剩余定理提出一种无可信中心可验证门限签名秘密共享方案。该方案无需可信中心的参与,每个成员被视为分发者,通过相互交换秘密份额影子协同产生各自的秘密份额,从而避免可信中心的权威欺骗。成员利用自己的秘密份额产生部分签名,再由部分签名合成组签名,在签名过程中不直接利用或暴露组私钥,从而保证组私钥的可重用性。基于离散对数求解困难性,构造秘密份额影子验证式,从而识别成员之间的欺骗行为,有效防止成员之间的恶意欺诈。实验结果表明,与基于拉格朗日插值的秘密共享方案相比,该方案具有较高的计算效率。A new verifiable threshold signature scheme without a trusted center is proposed based on Chinese Remainder Theorem（CRT）.The scheme do not needed the trusted center.Each participant is regarded as a distributor,and generates his own secret share by exchanging secret share shadows with the others,which can avoid the trusted center＇ s authority deception.Participants use their own secret shares to generate the partial signatures,and the group signature is composed of the partial signatures,which means the group private key is not used or exposed directly,so that the group private key＇s reusability can be ensured.Based on the discrete logarithm problem,the scheme constructs the secret shadow verification formula,so that it can identify the participants mutual cheating to prevent the malicious fraud of the participants effectively.Experimental results show that compared with the secret sharing schemes based on Lagrange interpolation,this scheme is more efficient.

关 键 词：秘密共享 可信中心 可验证 门限签名 中国剩余定理 离散对数问题 

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