We provide an intermediate solution to this problem, by designing a new identity-based signature scheme which allows aggregation when the signatures to be aggregated come all from the same signer. The new scheme is deterministic and enjoys some better properties than the previous proposals. We formally prove that the scheme is unforgeable, in the random oracle model, assuming that the Computational co-Diffie-Hellman problem is hard to solve.
Category / Keywords: public-key cryptography / identity-based signatures, aggregation of signatures, provable security, random oracle model Publication Info: The Computer Journal, Volume 49, Number 3, pp. 322-330, 2006 Date: received 6 Sep 2005, last revised 24 Nov 2010 Contact author: jherranz at ma4 upc edu Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20101124:114635 (All versions of this report) Short URL: ia.cr/2005/313 Discussion forum: Show discussion | Start new discussion