ID-Based Multi-Signature Scheme in Electronic Communication

Abstract:

An efficient identity-based (or ID-based) multi-signature (IBMS) scheme from RSA is proposed based on a variation of the Fiat-Shamir signature scheme. The proposed scheme with fixed signature length has a much more efficient signing procedure. Each user can sign a different message; subsequently a set of signatures can be turned into a multi-signature via an aggregation process which may be executed by any entity. Also the multi-signature verification time of modulo exponentiations required is the same as that of a single signature. And the proposed scheme can be proved to be secure against attacks from the adaptive given identity attack, chosen message attack and multi-signer collusion attack.

• Periodical: Applied Mechanics and Materials (Volumes 385-386)
• Pages: 1808-1812
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.385-386.1808
• Online since: August 2013
• Authors: Qiu Na Niu
• Keywords: ID-Based Signature, Multi-Signature, RSA

References

[1] A., Shamir. Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds. ) CRYPTO 1984. LNCS, Springer, Heidelberg (1984), vol. 196, pp.47-53.

[2] A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko AM, editor. Advances in cryptology – Crypto'86. LNCS, Springer-Verlag (1987), vol. 263. pp.186-94.

DOI: 10.1007/3-540-47721-7_12

[3] K. Ohta and T. Okamoto. Multi-signature schemes secure against active insider at-tacks. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, January (1999), E82-A (1), pp.21-31.

[4] M. Bellare and G. Neven. Identity-based multi-signatures from RSA. CT-RSA 2007, Springer-Verlag, LNCS , 4377, (2007), pp.145-162.

DOI: 10.1007/11967668_10

[5] Harna L, Ren J. Efficient identity-based RSA multi-signatures. Computers & Security. 27(1-2), (2008), pp.12-15.

[6] Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed. ) CRYPTO 2001. Springer-Verlag, Heidelberg, LNCS, vol. 2139, (2001), p.213–229.

DOI: 10.1007/3-540-44647-8_13

[7] Cocks C. An identity based encryption scheme based on quadratic residues. In the 8th IMA International Conference on Cryptography and Coding. IMA 2001, LNCS, Springer-Verlag Heidelberg. Vol. 2260. pp.360-363.

DOI: 10.1007/3-540-45325-3_32

[8] Chai ZC, Cao ZF, Dong XL. Identity-based signature scheme based on quadratic residues. Science in China Series F, Information Science. 50(3), (2007), pp.373-380.

DOI: 10.1007/s11432-007-0038-1

[9] S. Micali, K. Ohta, L. Reyzin. Accountable-subgroup multisignatures. In Pro. of the 8th ACM conference on Computer and Communications Security. New York, USA (2001), pp.245-254.

DOI: 10.1145/501983.502017

[10] M. Bellare, C. Namprempre, D. Pointcheval. The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme. J. Cryptology, (2003), 16(3), pp.185-215.

DOI: 10.1007/s00145-002-0120-1