all InfoSec news
Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs
Nov. 21, 2022, 2:24 p.m. |
IACR News www.iacr.org
ePrint Report: Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs
Jeff Burges, Oana Ciobotaru, Syed Lavasani, Alistair Stewart
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 …
More from www.iacr.org / IACR News
Updatable Policy-Compliant Signatures
19 hours ago |
www.iacr.org
Guess and Determine Analysis Based on Set Split
19 hours ago |
www.iacr.org
Real-Valued Somewhat-Pseudorandom Unitaries
1 day, 22 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Azure Security Architect
@ First Quality | Remote US - Eastern or Central Timezone
Senior Security Engineer
@ LRQA | Birmingham, GB, B37 7ES
Product Security Intern
@ Sinch | Chicago, Illinois, United States
Cyber Support Engineer
@ Darktrace | New York