International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Comparing Two Pairing-Based Aggregate Signature Schemes

Authors:
Sanjit Chatterjee
Darrel Hankerson
Edward Knapp
Alfred Menezes
Download:
URL: http://eprint.iacr.org/2009/060
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2009-18210,
  title={Comparing Two Pairing-Based Aggregate Signature Schemes},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography /},
  url={http://eprint.iacr.org/2009/060},
  note={ ajmeneze@uwaterloo.ca 14281 received 5 Feb 2009},
  author={Sanjit Chatterjee and Darrel Hankerson and Edward Knapp and Alfred Menezes},
  year=2009
}