Efficient discrete logarithm based multi-signature scheme in the plain public key model
In this paper, we provide a new multi-signature scheme that is proven secure in the plain public key model. Our scheme is practical and efficient according to computational costs, signature size and security assumptions. At first, our scheme matches the single ordinary discrete logarithm based signature scheme in terms of signing time, verification time and signature size. Secondly, our scheme requires only two rounds of interactions and each signer needs nothing more than a certified public key to produce the signature, meaning that our scheme is compatible with existing PKIs. Thirdly, our scheme has been proven secure in the random oracle model under standard discrete logarithm (DL) assumption. It outperforms a newly proposed multi-signature scheme by Bagherzandi, Cheon and Jarecki (BCJ scheme) in terms of both computational costs and signature size.
Cryptography, Digital signature, Multi-signature, Provable security, Plain public key model
Information Security and Trust
Designs, Codes and Cryptography
MA, Changshe; Weng, Jian; LI, Yingjiu; and DENG, Robert H..
Efficient discrete logarithm based multi-signature scheme in the plain public key model. (2010). Designs, Codes and Cryptography. 54, (2), 121-133. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/751