The Web3 Foundation team also has research and code in that direction:
- Paper: Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs
Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs
Jeff Burdges, Oana Ciobotaru, Syed Lavasani, Alistair StewartBLS 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 G1 and G2, with a proof-of-possession check for correctness. Second, aggregated BLS signatures should carry their particular aggregate public key in G2, so that verifiers can do both hash-to-curve and aggregate public key checks in G1. 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.
- Presentation at zkSummit 7: https://www.youtube.com/watch?v=UaPdDYarKGY&list=PLj80z0cJm8QFnY6VLVa84nr-21DNvjWH7&index=20
- Intro of accountable Light Clients: Accountable Light Client Systems for Secure and Efficient Bridges — Research at W3F
- Repo: GitHub - w3f/apk-proofs
Lagrange Lab has also been looking into “updatable BLS signature aggregates” and into zkLightClient and zkBridge acceleration: