Transitive Signature Based on Bilinear Pairings
Wang Jing-tong · Computer Engineering and Applications Journal · 2006
In this paper,we construct the transitive signature scheme based on bilinear pairings over elliptic curves or super elliptic curves.If one-more CDH problem is hard and standard signature scheme is unforgeable under adaptive chosen-message attack,our scheme is transitively unforgeable under adaptive chosen-message attack.Up to now,the bilinear pairing over elliptic curves or super elliptic curves is the only tool to construct Gap Diffie-Hellman group,hence the signature length of our transitive scheme is the shortest among all transitive schemes.