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 Shoup’s 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.
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.
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
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.
[4]
KAYA K and SELÇUK 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.
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.
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.
[7]
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.
[8]
JARECKI S and SAXENA N. Further simplifications in proactive RSA signature schemes[C]. Proceedings of TCC’05, Massachusetts, USA, 2005: 510-528.
[9]
FRANKEL Y, GEMMELL P, MACKENZIE P D, et al. Proactive RSA[C]. Proceedings of CRYPTO’97, California, USA, 1997: 440-454.
[10]
RABIN T. A simplified approach to threshold and proactive RSA[C]. Proceedings of CRYPTO’98, California, USA, 1998: 89-104.
[11]
FRANKEL Y, MACKENZIE P D, and YUNG M. Adaptive security for the additive-sharing based proactive RSA[C]. Proceedings of PKC’01, Cheju Island, Korea, 2001: 240-263.
[12]
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.
[13]
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.
[14]
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.
[15]
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.
[16]
SHOUP V. Practical threshold signatures[C]. Proceedings of EUROCRYPT 2000, Bruges, Belgium, 2000: 207-220.
[17]
ZHOU L and HAAS Z J. Securing Ad hoc networks[J]. IEEE Network, 1999, 13(6): 24-30.