Cryptology ePrint Archive: Report 2009/060

Comparing Two Pairing-Based Aggregate Signature Schemes

Sanjit Chatterjee and Darrel Hankerson and Edward Knapp and Alfred Menezes

Abstract: In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the random oracle model. The first pairing-based aggregate signature scheme which has a security proof that does not make the random oracle assumption was proposed in 2006 by Lu, Ostrovsky, Sahai, Shacham and Waters (LOSSW). In this paper, we compare the security and efficiency of the BGLS and LOSSW schemes when asymmetric pairings derived from Barreto-Naehrig (BN) elliptic curves are employed.

Category / Keywords: public-key cryptography /

Date: received 5 Feb 2009, last revised 22 Sep 2009

Contact author: ajmeneze at uwaterloo ca

Available format(s): PDF | BibTeX Citation

Version: 20090922:213727 (All versions of this report)

Short URL: ia.cr/2009/060

Discussion forum: Show discussion | Start new discussion