full version. Unrestricted Aggregate Signatures (2006)
BibTeX
@MISC{Bellare06fullversion.,
author = {Mihir Bellare and Chanathip Namprempre and Gregory Neven},
title = {full version. Unrestricted Aggregate Signatures},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Secure use of the BGLS [7] aggregate signature schemes is restricted to the aggregation of distinct messages (for the basic scheme) or per-signer distinct messages (for the enhanced, prepend-public-key version of the scheme). We argue that these restrictions preclude interesting applications, make usage of the schemes error-prone and are generally undesirable in practice. Via a new analysis and proof, we show how the restrictions can be lifted, yielding the first truly unrestricted aggregate signature scheme. Via another new analysis and proof, we show that the distinct signer restriction on the sequential aggregate signature schemes of [18] can also be dropped, yielding an unrestricted sequential aggregate signature scheme. Finally, we present variants of these schemes with tight security reductions. 1 Supported by NSF grants CNS-0524765 and CNS-0627779, and a gift from Intel Corporation. 2 Supported by the Thailand Research Fund.
Keyphrases
full version aggregate signature new analysis tight security reduction aggregate signature scheme thailand research fund secure use present variant distinct signer restriction distinct message per-signer distinct message prepend-public-key version intel corporation unrestricted aggregate signature scheme sequential aggregate signature scheme basic scheme unrestricted sequential aggregate signature scheme interesting application nsf grant cns-0524765
