✳flâneur — a map of the web's best reading

BLS Multi-Signatures With Public-Key Aggregation

crypto.stanford.edu · 4,268 words · saved by 1 readers

Abstract. This short note describes a simple approach for aggregating many BLS signatures on a common message, so that verifying the short multi-signature is fast. Moreover, the system supports public key aggregation, where the verification algorithm only uses a short aggregated public key. The original public keys are not needed for verifying the multi-signature. An important property of the construction is that the scheme is secure against a rogue public-key attack without requiring users to prove knowledge of their secret keys (this is sometimes called the plain public-key model). The construction builds upon the work of Bellare and Neven, and the recent work of Maxwell, Poelstra, Seurin, and Wuille. Note: The full version of this work titled Compact Multi-Signatures for Smaller Blockchains is available here. The BLS signature scheme [BLS01] operates in a prime order group and supports simple threshold signature generation, threshold key generation, and signature aggregation [BGLS03

BLS Multi-Signatures With Public-Key Aggregation \( % TeX macros \newcommand{\G}{\mathbb{G}} \newcommand{\Z}{\mathbb{Z}} \newcommand{\adv}{{\cal A}} \newcommand{\bdv}{{\cal B}} \newcommand{\deq}{\mathrel{\mathop:}=} \newcommand{\SK}{\mathit{sk}} \newcommand{\PK}{\mathit{pk}} \newcommand{\APK}{\mathit{apk}} \newcommand{\MM}{\mathcal{M}} \newcommand{\rgets}{\mathop{\gets\!\!\!\!\!\mbox{}^{\scriptscriptstyle\text{R}}\kern.2em}\ } \newcommand{\xwedge}{\, \operatorname{\text{\(\wedge\)}}\, } \newcommand{\abs}[1]{\lvert #1 \rvert} \newcommand{\Hm}{H_0} \newcommand{\Hpk}{H_1} \newcommand{\qHpk}{Q_{\H

Explore this link on the map →

related reading