Simple Schnorr multi-signatures with applications to Bitcoin

【Author】 Maxwell, Gregory; Poelstra, Andrew; Seurin, Yannick; Wuille, Pieter

【Source】DESIGNS CODES AND CRYPTOGRAPHY

【影响因子】1.397

【Abstract】We describe a new Schnorr-based multi-signature scheme (i.e., a protocol which allows a group of signers to produce a short, joint signature on a common message) called MuSig, provably secure under the Discrete Logarithm assumption and in the plain public-key model (meaning that signers are only required to have a public key, but do not have to prove knowledge of the private key corresponding to their public key to some certification authority or to other signers before engaging the protocol). MuSig improves over the state-of-art scheme of Bellare and Neven (ACM Conference on Computer and Communications Security-CCS 2006) and its variants by Bagherzandi et al. (ACM Conference on Computer and Communications Security-CCS 2008) and Ma et al. (Des Codes Cryptogr 54(2):121-133, 2010) in two respects: (i) it is simple and efficient, having the same key and signature size as standard Schnorr signatures; (ii) it allows key aggregation, which informally means that the joint signature can be verified exactly as a standard Schnorr signature with respect to a single "aggregated" public key which can be computed from the individual public keys of the signers. To the best of our knowledge, this is the first multi-signature scheme provably secure under the Discrete Logarithm assumption in the plain public-key model which allows key aggregation. As an application, we explain how our new multi-signature scheme could improve both performance and user privacy in Bitcoin.

【Keywords】Multi-signatures; Schnorr signatures; Key aggregation; Discrete logarithm problem; Forking lemma; Bitcoin

【发表时间】2019 SEP

【收录时间】2022-01-02

【文献类型】

【主题类别】

--