Welcome to the resource topic for
**2022/1611**

**Title:**

Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs

**Authors:**
Jeff Burges, Oana Ciobotaru, Syed Lavasani, Alistair Stewart

**Abstract:**

BLS signatures have fast aggregated signature verification but slow individual signature verification. We propose a three part optimisation that dramatically reduces CPU time in large distributed system using BLS signatures: First, public keys should be given on both source groups \mathbb{G}_1 and \mathbb{G}_2, with a proof-of-possession check for correctness. Second, aggregated BLS signatures should carry their particular aggregate public key in \mathbb{G}_2, so that verifiers can do both hash-to-curve and aggregate public key checks in \mathbb{G}_1. Third, individual non-aggregated BLS signatures should carry short Chaum-Pedersen DLEQ proofs of correctness, so that verifying individual signatures no longer requires pairings, which makes their verification much faster. We prove security for these optimisations. The proposed scheme is implemented and benchmarked to compare with classic BLS scheme.

**ePrint:**
https://eprint.iacr.org/2022/1611

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .