Proven Security and Efficiency of Gap Diffie-Hellman Group Blind Signature in E-Commerce

Abstract:

Recently bilinear pairings have found various applications in cryptosystems. However, a natural open question is to construct a secure and efficient pairing system without the MapToPoint hash function. The new scheme offers a less order of security and efficiency than the existing other signature schemes based on discrete logarithm. Furthermore, our scheme upholds all desirable properties of previous blind signature schemes, and requires general cryptographic hash function instead of MapToPoint hash function that is inefficient and probabilistic. It can apply in more critical systems like e-voting, e-commerce and e-payment systems that need higher security against sophisticated attacks and can preserve participants’ anonymity. The security and efficiency of the proposed method is analyzed and presented. We believe that the proposed idea can be applicable to all other usages for all blind signatures.

• Periodical: Applied Mechanics and Materials (Volumes 284-287)
• Pages: 3522-3526
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.284-287.3522
• Online since: January 2013
• Authors: Erl Huei Lu, Henry Ker Chang Chang, Shu Hwang Liaw, Pin Chang Su
• Keywords: Bilinear Pairing, Blind Signature, Cryptosystems, E-Commerce (EC), Gap Diffie-Hellman (GDH) Approach

References

[1] W. Diffie, M. E. Hellman, New directions in cryptography, IEEE Trans. Inf. Theory, (1976), IT-22, (6), pp.644-654.

DOI: 10.1109/tit.1976.1055638

[2] D. Chaum, Blind signatures for untraceable payments", Advances in Cryptology Crypt , 82, Springer-Verlag (1982), pp.199-203.

DOI: 10.1007/978-1-4757-0602-4_18

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

DOI: 10.1007/s00145-002-0120-1

[4] A. Boldyreva, Efficient threshold signature, multisignature, and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme, Proc. CRYPTO 2003, Springer-Verlag (2003), pp.31-46.

DOI: 10.1007/3-540-36288-6_3

[5] D. Boneh, M. Franklin, Identity-based encryption from the Weil paring, Proc. CRYPTO 2001, Springer-Verlag (2001), pp.213-229.

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

[6] H. Yoon, J. H. Cheon and Y. Kim, Batch verifications with ID-based signatures, ICISC 2004, LNCS 3506, Springer-Verlag (2005), pp.223-248.

[7] F. Zhang, K. Kim, Efficient ID-based blind signature and proxy signature from Bilinear pairings, Proc. of ACISP2003, Berlin: Springer-Verlag (2003), pp.312-323.

DOI: 10.1007/3-540-45067-x_27

[8] Z. Huang, K. Chen and Y. Wang, Efficient identity-based signatures and blind signature, CANS2005, Springer-Verlag, (2005), pp.120-133.

[9] H. Du, Q. Wen, An efficient identity-based short signature scheme from Bilinear pairings, , 2007 International Conference on Computational Intelligence and Security, (2007), pp.725-729.

DOI: 10.1109/cis.2007.168

[10] W. Cui, Y. Xin, Y. Yang and X. Niu, A new blind signature and threshold blind signature scheme from pairings, 2007 International Conference on Computational Intelligence and Security Workshop, (2007), pp.699-702.

DOI: 10.1109/cisw.2007.4425591

[11] X. Yang, Z. Liang, P. Wei and J. Shen, A provably secure certificateless blind signature scheme, 2009 Fifth International Conference on Information Assurance and Security, (2009), pp.643-646.

DOI: 10.1109/ias.2009.257

[12] K. Shim, Efficient one round tripartite authenticated key agreement protocol from Weil pairing, Electronics Letters, Vol. 39(2), (2003), pp.208-209.

DOI: 10.1049/el:20030170

[13] R. Dutta, R. Barua and P. Sarkar, Pairing-based cryptographic protocols : a survey , Cryptology ePrint Archive, Report 2004/064, (2004).

[14] S. Han, E. Chang and T. Dillon, Knapsack Diffie-Hellman: a new family of Diffie-Hellman, Cryptology ePrint Archive: Report (2005)/347, pp.1-17. http: /eprint. iacr. org/2005/347.