基于中國(guó)剩余定理的門限RSA簽名方案的改進(jìn)
doi: 10.11999/JEIT150067
基金項(xiàng)目:
國(guó)家科技重大專項(xiàng)(2012ZX03002003)
Improvement of Threshold RSA Signature Scheme Based on Chinese Remainder Theorem
Funds:
The National Science and Technology Major Project of China (2012ZX03002003)
-
摘要: 針對(duì)基于中國(guó)剩余定理的門限RSA簽名方案無(wú)法簽署某些消息,以及部分簽名合成階段運(yùn)算量大的問(wèn)題,論文提出一種基于虛擬群成員的改進(jìn)方法,使得改進(jìn)后的方案能夠簽署所有消息,同時(shí)能夠極大地減少部分簽名合成階段的運(yùn)算量,當(dāng)門限值為10時(shí),可以將部分簽名合成階段的運(yùn)算量減少為原來(lái)的1/6。對(duì)改進(jìn)方案進(jìn)行了詳細(xì)的安全性和實(shí)用性分析。結(jié)果表明,改進(jìn)方案在適應(yīng)性選擇消息攻擊下是不可偽造的,且其運(yùn)算效率較其他門限RSA簽名方案更高。
-
關(guān)鍵詞:
- 門限簽名 /
- RSA簽名方案 /
- Asmuth-Bloom秘密共享 /
- 中國(guó)剩余定理
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. -
馬春光, 石嵐, 周長(zhǎng)利, 等. 屬性基門限簽名方案及其安全性研究[J]. 電子學(xué)報(bào), 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. 楊小東, 李春梅, 徐婷, 等. 無(wú)雙線性對(duì)的基于身份的在線/離線門限簽名方案[J]. 通信學(xué)報(bào), 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. 崔濤, 劉培玉, 王珍. 前向安全的指定驗(yàn)證者(t,n)門限代理簽名方案[J]. 小型微型計(jì)算機(jī)系統(tǒng), 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. 張文芳, 王小敏, 郭偉, 等. 基于橢圓曲線密碼體制的高效虛擬企業(yè)跨域認(rèn)證方案[J]. 電子學(xué)報(bào), 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. 徐秋亮. 改進(jìn)門限RSA數(shù)字簽名體制[J]. 計(jì)算機(jī)學(xué)報(bào), 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]. 電子與信息學(xué)報(bào), 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. 金晨輝, 鄭浩然, 張少武, 等. 密碼學(xué)[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. 譚麗娟, 陳運(yùn). 模逆算法的分析、改進(jìn)及測(cè)試[J]. 電子科技大學(xué)學(xué)報(bào), 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. 王貴林, 卿斯?jié)h, 王明生. Shoup門限RSA簽名方案的改進(jìn)[J]. 計(jì)算機(jī)研究與發(fā)展, 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. -
計(jì)量
- 文章訪問(wèn)數(shù): 1438
- HTML全文瀏覽量: 147
- PDF下載量: 435
- 被引次數(shù): 0