Abstract
We present an aggregate signature scheme whose public key consists of only two group elements. It is therefore the first sequential aggregate signature scheme with short keys in the standard model. Our construction relies on the Camenisch-Lysyanskaya signature scheme (Crypto 2004) and is provably secure under the LRSW assumption. Moreover, we develop a novel aggregation technique that we call aggregate-extension technique. The basic idea is to extend the aggregate by a single element and to use this additional space to "store" some information that would be lost due to the compression of the signatures. We believe that this technique might be of independent interest. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Schröder, D. (2011). How to aggregate the CL signature scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6879 LNCS, pp. 298–314). Springer Verlag. https://doi.org/10.1007/978-3-642-23822-2_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.