[Resource Topic] 2003/091: Sequential Aggregate Signatures from Trapdoor Permutations

Welcome to the resource topic for 2003/091

Sequential Aggregate Signatures from Trapdoor Permutations

Authors: Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham


An aggregate signature scheme (recently proposed by Boneh, Gentry,
Lynn and Shacham) is a method for combining n signatures from n
different signers on n different messages into one signature of unit
length. We propose \emph{sequential aggregate signatures}, in which
the set of signers is ordered. The aggregate signature is computed by
having each signer, in turn, add his signature to it. We show how to
realize this in such a way that the size of the aggregate signature is
independent of n. This makes sequential aggregate signatures a
natural primitive for certificate chains, whose length can be reduced
by aggregating all signatures in a chain. We give a construction
based on families of certified trapdoor permutations, and show how to
instantiate our scheme based on RSA.

ePrint: https://eprint.iacr.org/2003/091

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 .