Paper 2022/1611
Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs
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
Note: Some corrections. Change of affiliation for second author.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- aggregated BLS signaturesproofs-of-possessionChaum-Pedersen proofsefficient verification
- Contact author(s)
-
jeff @ web3 foundation
oana ciobotaru @ gmail com
syed @ web3 foundation
stewart al @ gmail com - History
- 2023-09-19: last of 10 revisions
- 2022-11-18: received
- See all versions
- Short URL
- https://ia.cr/2022/1611
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1611, author = {Jeff Burdges and Oana Ciobotaru and Syed Lavasani and Alistair Stewart}, title = {Efficient Aggregatable {BLS} Signatures with Chaum-Pedersen Proofs}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1611}, year = {2022}, url = {https://eprint.iacr.org/2022/1611} }