基于多項(xiàng)式秘密共享的前攝性門限RSA簽名方案
doi: 10.11999/JEIT151164 cstr: 32379.14.JEIT151164
基金項(xiàng)目:
國家科技重大專項(xiàng)(2012ZX03002003)
Proactive Threshold RSA Signature Scheme Based on Polynomial Secret Sharing
Funds:
The National Science and Technology Major Project of China (2012ZX03002003)
-
摘要: 現(xiàn)有可證明安全的前攝性門限RSA簽名方案均依賴加性秘密共享方法,存在每次簽名均需所有成員參與,易暴露合法成員的秘密份額,簽名效率低下等問題。該文以Shoup門限簽名為基礎(chǔ),提出一種基于多項(xiàng)式秘密共享的前攝性門限RSA簽名方案,并對其進(jìn)行了詳細(xì)的安全性及實(shí)用性分析。結(jié)果表明,在靜態(tài)移動攻擊者模型中,該方案是不可偽造的和穩(wěn)健的,與現(xiàn)有同類方案相比,其通信開銷更低,運(yùn)算效率更高。
-
關(guān)鍵詞:
- 門限簽名 /
- RSA /
- 多項(xiàng)式秘密共享 /
- 前攝性
Abstract: All the existing provable secure proactive threshold RSA signature schemes rely on additive secret sharing, in which all players have to cooperate to produce a signature, valid players secret shares may be exposed, and the computing efficiency is too low. Based on Shoups threshold RSA signature scheme, a proactive threshold RSA signature scheme is proposed by using polynomial secret sharing, and its security and practicability are analyzed. Results show that the proposed scheme is unforgeable and robust under the model of static mobile adversary, and compared with the existing comparable schemes, its communication overhead is lower and computing efficiency is higher.-
Key words:
- Threshold signature /
- RSA /
- Polynomial secret sharing /
- Proactiveness
-
徐甫, 馬靜謹(jǐn). 基于中國剩余定理的門限RSA簽名方案的改進(jìn)[J]. 電子與信息學(xué)報, 2015, 37(10): 2495-2500. doi: 10. 11999/JEIT150067. XU Fu and MA Jingjin. Improvement of threshold RSA signature scheme based on Chinese remainder theorem[J]. Jouranl of Electronic Information Technology, 2015, 37(10): 2495-2500. doi: 10.11999/JEIT150067. 王潔, 蔡永泉, 田有亮. 基于博弈論的門限簽名體制分析與構(gòu)造[J]. 通信學(xué)報, 2015, 36(5): 1-8. doi:10.11959/j.issn.1000- 436x.2015189. WANG Jie, CAI Yongquan, and TIAN Youliang. Analysis and construction for threshold signature scheme based on game theory[J]. Journal on Communications, 2015, 36(5): 1-8. doi: 10.11959/j.issn.1000-436x.2015189 曹陽. 基于秘密共享的數(shù)字簽名方案[J]. 重慶郵電大學(xué)學(xué)報(自然科學(xué)版), 2015, 27(3): 418-421. doi: 10.3979 /j.issn. 1673-825X.2015.03.021. CAO Yang. Digital signature scheme based on secret sharing[J]. Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), 2015, 27(3): 418-421. doi: 10.3979/j.issn.1673-825X.2015.03.021. KAYA K and SELUK A A. Sharing DSS by the Chinese remainder theorem[J]. Journal of Computational and Applied Mathematics, 2014, 259: 495-502. doi: 10.1016/j.cam. 2013. 05.023. 崔濤, 劉培玉, 王珍. 前向安全的指定驗(yàn)證者(t, n)門限代理簽名方案[J]. 小型微型計算機(jī)系統(tǒng), 2014, 35(5): 1061-1064. CUI Tao, LIU Peiyu, 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é)報, 2014, 42(6): 1095-1102. doi: 10.3969 /j.issn.0372-2112.2014.06.010. ZHANG Wenfang, WANG Xiaomin, 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. doi: 10.3969/j.issn.0372-2112.2014.06.010. HERZBERG A, JAKOBSSON M S, JARECKI H, et al. Proactive public key and signature systems[C]. Proceedings of the 4th ACM Conference on Computers and Communication Security, Zurich, Switzerland, 1997: 100-110. JARECKI S and SAXENA N. Further simplifications in proactive RSA signature schemes[C]. Proceedings of TCC05, Massachusetts, USA, 2005: 510-528. FRANKEL Y, GEMMELL P, MACKENZIE P D, et al. Proactive RSA[C]. Proceedings of CRYPTO97, California, USA, 1997: 440-454. RABIN T. A simplified approach to threshold and proactive RSA[C]. Proceedings of CRYPTO98, California, USA, 1998: 89-104. FRANKEL Y, MACKENZIE P D, and YUNG M. Adaptive security for the additive-sharing based proactive RSA[C]. Proceedings of PKC01, Cheju Island, Korea, 2001: 240-263. ALMANSA J F, DAMGARD I, and NIELSEN J B. Simplified threshold RSA with adaptive and proactive security[C]. Proceedings of EUROCRYPT 2006, Saint Petersburg, Russia, 2006: 593-611. LUO H, KONG J, ZERFOS P, et al. URSA: Ubiquitous and robust access control for mobile ad hoc networks[J]. IEEE/ACM Transactions on Networking, 2004, 12(6): 1049-1063. doi: 10.1109/TNET.2004.838598. FRANKEL Y, GEMMELL P, MACKENZIE P D, et al. Optimal-resilience proactive public-key cryptosystems[C]. Proceedings of the 38th Symposium on Foundations of Computer Science (FOCS), Miami Beach, USA, 1997: 384-393. JARECKI S and SAXENA N. On the insecurity of proactive RSA in the URSA mobile ad hoc network access control protocol[J]. IEEE Transactions on Information Forensics and Security, 2010, 5(4): 739-749. doi: 10.1109/TIFS.2010. 2058104. SHOUP V. Practical threshold signatures[C]. Proceedings of EUROCRYPT 2000, Bruges, Belgium, 2000: 207-220. ZHOU L and HAAS Z J. Securing Ad hoc networks[J]. IEEE Network, 1999, 13(6): 24-30. -
計量
- 文章訪問數(shù): 1850
- HTML全文瀏覽量: 173
- PDF下載量: 440
- 被引次數(shù): 0