Proactive Threshold RSA Signature Scheme Based on Polynomial Secret Sharing
Xu Fu · 2016
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.