A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Transitive Signatures: New Schemes and Proofs
2005
IEEE Transactions on Information Theory
We present novel realizations of the transitive signature primitive introduced by Micali and Rivest [MR02], enlarging the set of assumptions on which this primitive can be based, and also providing performance improvements over existing schemes. More specifically, we propose new schemes based on factoring, the hardness of the one-more discrete logarithm problem, and gap Diffie-Hellman groups. All these schemes are proven transitively unforgeable under adaptive chosen-message attack in the
doi:10.1109/tit.2005.847697
fatcat:ayqx2zbcxzeflnez2veuwzoeeu