Certificateless proxy multi-signature

详细信息    查看全文

• 作者：Hongzhen Du^a ; ^{duhongzhen@gmail.com" class="auth_mail} ; Qiaoyan Wen^b
• 关键词：Certificateless cryptography ; Proxy signature ; Proxy multi-signature ; Bilinear pairing ; Computational Diffie&ndash ; Hellman problem
• 刊名：Information Sciences
• 出版年：20 August 2014
• 年：2014
• 卷：276
• 期：Complete
• 页码：21-30
• 全文大小：387 K

文摘

Proxy multi-signature allows a group of original signers to delegate their signing capabilities to a proxy signer in such a way that the proxy signer can sign messages on behalf of the group of original signers. Existing constructions of proxy multi-signatures are based on traditional Public Key Infrastructure or Identity-based Public Key Setting, but the former needs certificates which bring about many certificate management problems, and the latter has a drawback of key escrow. In contrast to the existing constructions, in this paper, we study proxy multi-signature in Certificateless Public Key Cryptography (CL-PKC) which combines the advantages of both certificate-based and identity-based cryptosystems as it avoids the use of certificates and does not suffer from key escrow. We provide the definition and the security model for Certificateless Proxy Multi-Signature (CLPMS), and propose the first CLPMS scheme which is proved to be secure in the random oracle model under the computational Diffie–Hellman assumption. Our scheme is computationally efficient and has the property that the size of a proxy multi-signature is independent of the number of the original signers.