计算机工程Issue(2)：122-128,7.DOI:10.3969/j.issn.1000-3428.2015.02.024
基于中国剩余定理的无可信中心可验证秘密共享研究
Research on Verifiable Secret Sharing Without Trusted Center Based on Chinese Remainder Theorem
摘要
Abstract
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.关键词
秘密共享/可信中心/可验证/门限签名/中国剩余定理/离散对数问题Key words
secret sharing/trusted center/verifiable/threshold signature/Chinese Remainder Theorem ( CRT )/discrete logarithm problem分类
信息技术与安全科学引用本文复制引用
杨阳,朱晓玲,丁凉..基于中国剩余定理的无可信中心可验证秘密共享研究[J].计算机工程,2015,(2):122-128,7.基金项目
广东省教育部产学研结合基金资助项目(2008090200049)。 （2008090200049）
