On Several Problems Of The Transitive Signature Scheme

Several transitive signature schemes and models have been proposed after Micali and Rivest first proposed the notion of transitive signature in 2002.Summarizing the existing transitive schemes,we analyze the factoring-based transitive signature schemes FactTS-1 and FactTS-2 introduced by Bellare and Neven[4].We present alternative realizations of the factoring-based transitive signature schemes FactTS-1 and FactTS-2, namely,FactTS-3 and FactTS-4.Corresponding to FactTS-1,FactTS-3 bases on the node certification paradigm and remains provably secure in the standard model;Corresponding to FactTS-2,FactTS-4 that is free from the node certification paradigm bases on the hash function and remains provably secure in the random oracle model.We prove the factoring-based transitive signature schemes FactTS-3 and FactTS-4 and present cost comparisons amongst all the factoring-based transitive signature schemes.As for performance, the cost of signing and verification of the new schemes is lower than the existing ones,while the cost of composition of the new schemes is higher than the existing ones. Under the circumstances where the number of requirements of verification are more than composition,the new schemes will be more efficient.