Aggregatable Signatures from an Inner Pairing Product Argument
We present a new public-coin setup protocol for aggregating BLS signatures on distinct messages. For n messages the verifier computes just 6 pairings and 6(n+ log(n)) exponentiations–an improvement on previous aggregate schemes in which the verifier computes n+ 1 pairings. Our aggregate signature is logarithmic in size. This result uses an inner pairing product argument of knowledge that can be used to prove membership in pairing-based languages.