Cryptology ePrint Archive: Report 2019/1177

Aggregatable Signatures from an Inner Pairing Product Argument

Mary Maller and Noah Vesely

Abstract: 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+\textrm{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 $\textit{inner pairing product argument}$ of knowledge that can be used to prove membership in pairing-based languages.

Category / Keywords: public-key cryptography / Inner Pairing Product Argument, Aggregatable Signatures, Bilinear Pairings

Date: received 9 Oct 2019

Contact author: noah vesely 18 at ucl ac uk,mary maller 15@ucl ac uk

Available format(s): PDF | BibTeX Citation

Version: 20191010:125504 (All versions of this report)

Short URL: ia.cr/2019/1177


[ Cryptology ePrint archive ]