[Resource Topic] 2004/215: Transitive Signatures: New Schemes and Proofs

Welcome to the resource topic for 2004/215

Transitive Signatures: New Schemes and Proofs

Authors: Mihir Bellare, Gregory Neven


We present novel realizations of the transitive signature
primitive introduced by Micali and Rivest, 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. We also provide
an answer to an open question raised by Micali and Rivest regarding the
security of their RSA-based scheme, showing that it is transitively
unforgeable under adaptive chosen-message attack assuming the
security of RSA under one-more-inversion. We then present hash-based
modifications of the RSA, factoring and gap Diffie-Hellman based
schemes that eliminate the need for ``node certificates’’ and
thereby yield shorter signatures. These modifications remain
provably secure under the same assumptions as the starting scheme,
in the random oracle model.

ePrint: https://eprint.iacr.org/2004/215

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .