An Alternative Realization of the Factoring-Based Transitive Signature Scheme

We present alternative realizations of the factoring-based transitive signature schemes introduced by Bellare and Neven, providing performance improvements over existent schemes to a certain extent. Specifically, our new schemes, FactTS-3 and FactTS-4, make the algorithms of signing and verifying easier but make the algorithm of composition more inconvenient. Note that verifying operations are more frequent than compositing operations in some circumstances, so our schemes will be more efficient in those circumstances. Additionally, FactTS-3 and FactTS-4 remains provably secure in the standard model and the random oracle model respectively.