基于中国剩余定理的门限RSA签名方案的改进

徐甫; 马静谨

doi:10.11999/JEIT150067

基于中国剩余定理的门限RSA签名方案的改进

doi: 10.11999/JEIT150067

徐甫¹,
马静谨¹

基金项目:

国家科技重大专项(2012ZX03002003)

计量
- 文章访问数: 1409
- HTML全文浏览量: 140
- PDF下载量: 434
- 被引次数: 0
出版历程
- 收稿日期: 2015-01-12
- 修回日期: 2015-05-28
- 刊出日期: 2015-10-19

Improvement of Threshold RSA Signature Scheme Based on Chinese Remainder Theorem

Xu Fu¹,
Ma Jing-jin¹

Funds:

The National Science and Technology Major Project of China (2012ZX03002003)

摘要

摘要: 针对基于中国剩余定理的门限RSA签名方案无法签署某些消息，以及部分签名合成阶段运算量大的问题，论文提出一种基于虚拟群成员的改进方法，使得改进后的方案能够签署所有消息，同时能够极大地减少部分签名合成阶段的运算量，当门限值为10时，可以将部分签名合成阶段的运算量减少为原来的1/6。对改进方案进行了详细的安全性和实用性分析。结果表明，改进方案在适应性选择消息攻击下是不可伪造的，且其运算效率较其他门限RSA签名方案更高。
- 门限签名 /
- RSA签名方案 /
- Asmuth-Bloom秘密共享 /
- 中国剩余定理
Abstract: To slove the problems that Chinese Remainder Theorem (CRT) based threshold RSA signature scheme can not be used to sign some messages and the amount of computation in partial signatures combining phase is large, an improving method is proposed, in which a virtual group member is introduced, making the scheme can be used to sign all messages and significantly reducing the amount of computation in partial signatures combining phase, e.g. when the threshold value is 10, the amount of computation in partial signatures combining phase can be reduced to 1/6 of the original. The security and practicability of the improved scheme are analyzed. Results show that it is non-forgeable against an adaptive chosen message attack and more efficient than other threshold RSA signatures.
- Threshold signature /
- RSA signature scheme /
- Asmuth-Bloom secret sharing /
- Chinese Remainder Theorem (CRT)

HTML全文

参考文献(26)

马春光, 石岚, 周长利, 等. 属性基门限签名方案及其安全性研究[J]. 电子学报, 2013, 41(5): 1012-1015.

Ma Chun-guang, Shi Lan, Zhou Chang-li, et al.. Threshold attribute-based signature and its security[J]. Acta Electronica Sinica, 2013, 41(5): 1012-1015.

杨小东, 李春梅, 徐婷, 等. 无双线性对的基于身份的在线/离线门限签名方案[J]. 通信学报, 2013, 34(8): 185-190.

Yang Xiao-dong, Li Chun-mei, Xu Ting, et al.. ID-based on-line/off-line threshold signature scheme without bilinear pairing[J]. Journal on Communications, 2013, 34(8): 185-190.

崔涛, 刘培玉, 王珍. 前向安全的指定验证者(t,n)门限代理签名方案[J]. 小型微型计算机系统, 2014, 35(5): 1061-1064.

Cui Tao, Liu Pei-yu, and Wang Zhen. Forward secure (t,n) threshold proxy signature scheme with designated verifier[J]. Journal of Chinese Computer Systems, 2014, 35(5): 1061-1064.

张文芳, 王小敏, 郭伟, 等. 基于椭圆曲线密码体制的高效虚拟企业跨域认证方案[J]. 电子学报, 2014, 42(6): 1095-1102.

Zhang Wen-fang, Wang Xiao-min, Guo Wei, et al.. An efficient inter-enterprise authentication scheme for VE based on the elliptic curve cryptosystem[J]. Acta Electronica Sinica, 2014, 42(6): 1095-1102.

Shoup V. Practical threshold signatures[C]. Proceedings of EUROCRYPT 2000, Bruges, Belgium, 2000: 207-220.

徐秋亮. 改进门限RSA数字签名体制[J]. 计算机学报, 2000, 23(5): 449-453.

Xu Qiu-liang. A modified threshold RSA digital signature scheme[J]. Chinese Journal of Computers, 2000, 23(5): 449-453.

张文芳, 何大可, 王小敏, 等. 基于新型秘密共享方法的高效RSA门限签名方案[J]. 电子与信息学报, 2005, 27(11): 1745-1749.

Zhang Wen-fang, He Da-ke, Wang Xiao-min, et al.. A new RSA threshold group signature scheme based on modified Shamirs secret sharing solution[J]. Journal of Electronic Information Technology, 2005, 27(11): 1745-1749.

Aboud S J, Yousef S, and Cole M. Undeniable threshold proxy signature scheme[C]. Proceedings of 5th International Conference on Computer Science and Information Technology, Amman, Jordan, 2013: 150-153.

Gennaro R, Jarecki S, Krawczyk H, et al.. Robust threshold DSS signatures[J]. Information and Computation, 2001, 164(1): 54-84.

Kim S, Kim J, Cheon J H, et al.. Threshold signature schemes for ElGamal variants[J]. Computer Standards Interfaces, 2011, 33(4): 432-437.

Shamir A. How to share a secret?[J]. Communications of the ACM, 1979, 22(11): 612-613.

Asmuth C and Bloom J. A modular approach to key safeguarding[J]. IEEE Transactions on Information Theory, 1983, 29(2): 208-210.

Kaya K and Sel?uk A A. Threshold cryptography based on Asmuth-Bloom secret sharing[J]. Information Sciences, 2007, 177(19): 4148-4160.

金晨辉, 郑浩然, 张少武, 等. 密码学[M]. 北京: 高等教育出版社, 2009: 244-367.

Jin Chen-hui, Zheng Hao-ran, Zhang Shao-wu, et al.. Cryptography[M]. Beijing: Higher Education Press, 2009: 244-367.

Iftene S and Grindei M. Weighted threshold RSA based on the Chinese remainder theorem[C]. Proceedings of Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, 2007: 175-181.

谭丽娟, 陈运. 模逆算法的分析、改进及测试[J]. 电子科技大学学报, 2004, 33(4): 383-386.

Tan Li-juan and Chen Yun. Analysis and improvement of modular inverse algorithm[J]. Journal of UEST of China, 2004, 33(4): 383-386.

王贵林, 卿斯汉, 王明生. Shoup门限RSA签名方案的改进[J]. 计算机研究与发展, 2002, 39(9): 1046-1050.

Wang Gui-lin, Qing Si-han, and Wang Ming-sheng. Improvement of Shoups threshold RSA signature scheme[J]. Journal of Computer Research and Development, 2002, 39(9): 1046-1050.

施引文献

资源附件(0)

访问统计