Efficient Aggregate Proxy Signature Scheme in ID-based Framework

Abstract

Ever since Mambo et al. [1] and Boneh et al. [2] introduced the notions of proxy signature and aggregate signature in 1996 and 2003 respectively; the cryptographic research took a rapid progress in these areas. Proxy signatures play a vital role in many real world applications when signatures are to be generated in the absence of the original signer. Aggregate signature schemes have wider applications and dramatically reduce the communication bandwidth and computational overhead. Keeping the merits of proxy and aggregate signatures, in this work, we propose an efficient aggregate proxy signature in Identity-based framework using bilinear pairings. This scheme achieves constant signature size and constant pairings operations for aggregate verification. We prove the security of the proposed scheme in random oracle paradigm, tightly related to the Computational Diffie-Hellman (CDH) problem. We compare the proposed scheme with related schemes.