×

A secure identity-based proxy multi-signature scheme. (English) Zbl 1156.94337

Summary: In a proxy multi-signature scheme, a designated proxy signer can generate the signature on behalf of a group of original signers. To our best knowledge, most of existing proxy multi-signature schemes are proposed in public key infrastructure setting, which may be the bottleneck due to its complexity. To deduce the complexity, several proxy multi-signature schemes are proposed in the ID-based setting. However, no formal definitions on ID-based proxy are proposed until now. To fill the gap, this paper proposes the formal definition. Furthermore, we present a proven secure ID-based proxy multi-signature scheme, which is more efficient than existing schemes in term of computational cost.

MSC:

94A60 Cryptography
94A62 Authentication, digital signatures and secret sharing
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Awasthi, A.K.; Lal, S., Proxy blind signature scheme, Transaction on cryptology, 2, 1, 5-11, (2005)
[2] Boneh, D.; Franklin, M., Identity-based encryption from the Weil pairing, SIAM journal of computing, 32, 3, 586-615, (2003), Extended abstract in Advances in Crptology-Crypto’01, LNCS 2139, Berlin, Springer-Verlag, 2001, pp. 213-229 · Zbl 1046.94008
[3] Bellare, M.; Namprempre, C.; Neven, G., Security proofs for identity-based identification and signature schemes, (), 268-286 · Zbl 1120.94309
[4] A. Boldyreva, A. Palacio, B. Warinschi, Secure proxy signature schemes for delegation of signing rights, Cryptology ePrint Archive: Report 2003/096/. · Zbl 1272.94016
[5] Fu, X.; Yi, L.; Xiao, G., A new type of proxy multi-signature schemes, Journal of Xidian university, 28, 6, 729-731, (2001)
[6] Huanga, H.; Chang, C., A novel efficient (t,n) threshold proxy signature scheme, Information sciences, 176, 10, 1338-1349, (2006) · Zbl 1091.94033
[7] Hsu, C.; Wu, T.; He, W., New proxy multi-signature scheme, Applied mathematics and computation, 162, 3, 1201-1206, (2005) · Zbl 1061.94055
[8] Ji, J.; Li, D., A new proxy multi-signature scheme, Journal of computer research and development, 41, 4, 715-719, (2004)
[9] Ji, J.; Li, D.; Wang, M., New proxy multi-signature, multi-proxy signature and multi-proxy multi-signature schemes from bilinear pairings, Chinese journal of computers, 27, 10, 1429-1435, (2004)
[10] Li, X.; Chen, K., ID-based multi-proxy signature, proxy multi-signature and multi-proxy multi-signature schemes from bilinear pairings, Applied mathematics and computation, 169, 1, 437-450, (2005) · Zbl 1076.94030
[11] Li, X.; Chen, K.; Li, S., Multi-proxy signature and proxy multi-signature schemes from bilinear pairings, (), 591-595 · Zbl 1076.94030
[12] B. Libert, J.J. Quisquater, The exact security of an identity based signature and its applications, Cryptology ePrint Archive: Report 2004/102/.
[13] Mambo, M.; Usuda, K.; Okamoto, E., Proxy signatures: delegation of the power to sign messages, IEICE transactions on fundamentals of electronic communications and computer science, E79-A, 9, 1338-1354, (1996)
[14] Shamir, A., Identity-based cryptosystems and signature schemes, (), 47-53 · Zbl 1359.94626
[15] Q. Wang, Z. Cao, Security arguments for partial delegation with warrant proxy signature schemes, Cryptology ePrint Archive: Report 2004/315/.
[16] Wang, Q.; Cao, Z.; Wang, S., Formalized security model of multi-proxy signature schemes, (), 668-672
[17] J. Xu, Z. Zhang, D. Feng, ID-based proxy signature Using bilinear pairings, Cryptology ePrint Archive: Report 2004/206/.
[18] Yi, L.; Bai, G.; Xiao, G., Proxy multi-signature scheme: a new type of proxy signature scheme, Electronics letters, 36, 6, 527-528, (2000)
[19] Zhou, H.; Tie, L.; Li, J.; Ni, Y., Improved proxy multi-signature scheme, Journal of Shanghai jiaotong university, 38, 1, 83-86, (2004)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.