Comparing two pairing-based aggregate signature schemes

Authors:
Sanjit Chatterjee;Darrel Hankerson;Edward Knapp;Alfred Menezes
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada N2L 3G1;Department of Mathematics and Statistics, Auburn University, Auburn, USA 36849;Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada N2L 3G1;Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada N2L 3G1
Venue:
Designs, Codes and Cryptography
Year:
2010

Citing 0
Cited 4

On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Ephemeral key leakage resilient and efficient ID-AKEs that can share identities, private and master keys

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Sequential aggregate signatures with lazy verification from trapdoor permutations

ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Practical hybrid hierarchical identity-based encryption schemes based on the decisional bilinear Diffie-Hellman assumption

International Journal of Applied Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.