International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Sequential Aggregate Signatures from Trapdoor Permutations

Authors:
Anna Lysyanskaya
Silvio Micali
Leonid Reyzin
Hovav Shacham
Download:
URL: http://eprint.iacr.org/2003/091
Search ePrint
Search Google
Abstract: 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.
BibTeX
@misc{eprint-2003-11806,
  title={Sequential Aggregate Signatures from Trapdoor Permutations},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / RSA, signature schemes, aggregate signatures},
  url={http://eprint.iacr.org/2003/091},
  note={Extended abstract in Proceedings of Eurocrypt 2004, pp. 74-90 hovav@cs.stanford.edu 12578 received 7 May 2003, last revised 9 Jun 2004},
  author={Anna Lysyanskaya and Silvio Micali and Leonid Reyzin and Hovav Shacham},
  year=2003
}