Sequential aggregate signatures from trapdoor permutations (2004)
Cached
Download Links
| Venue: | Advances in Cryptology – EUROCRYPT 2004 |
| Citations: | 39 - 3 self |
BibTeX
@INPROCEEDINGS{Lysyanskaya04sequentialaggregate,
author = {Anna Lysyanskaya and Silvio Micali and Leonid Reyzin and Hovav Shacham},
title = {Sequential aggregate signatures from trapdoor permutations},
booktitle = {Advances in Cryptology – EUROCRYPT 2004},
year = {2004},
pages = {74--90},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 sequential aggregate signatures, inwhichthesetof 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 in the random oracle model based on families of certified trapdoor permutations, and show how to instantiate our scheme based on RSA. 1
