AN EFFICIENT ELECTRONIC CASH SCHEME WITH MULTIPLE BANKS USING GROUP SIGNATURE

In 2008, an electronic cash scheme with multiple banks based on group sig- natures was proposed by Wang et al. They adopted a group blind signature scheme based on bilinear pairings to generate the electronic cash and it can be veried by the bilin- ear pairings operation. However, wend some security problems in their approach. By the way, the cost of communication and computation in their scheme can be improved further. Hence, we propose an efficient and secure e-cash scheme from bilinear pairings with multiple banks. Not only can our approach solve all the security problems in Wang et al.'s scheme but also offer lower computation and communication cost.

[1]  Yiannis Tsiounis,et al.  "Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash , 1996, ASIACRYPT.

[2]  Jan Camenisch,et al.  Fair Blind Signatures , 1995, EUROCRYPT.

[3]  Weidong Qiu.  A Fair Off-line Electronic Payment System , 2007, Contributions to Ubiquitous Computing.

[4]  Dawu Gu,et al.  A New Offline Privacy Protecting E-cash System with Revokable Anonymity , 2002, ISC.

[5]  Chun-I Fan,et al.  Fast Randomization Schemes for Chaum Blind Signatures , 2009 .

[6]  Reihaneh Safavi-Naini,et al.  An Efficient Signature Scheme from Bilinear Pairings and Its Applications , 2004, Public Key Cryptography.

[7]  Zhang Fang.  Electronic Cash System with Multiple Banks , 2001 .

[8]  Philippe A. Janson,et al.  The State of the Art in Electronic Payment Systems , 1997, Computer.

[9]  Kwangjo Kim,et al.  New ID-based group signature from pairings , 2006 .

[10]  Hung-Min Sun,et al.  A Novel ID-based Electronic Cash System from Pairings , 2009, IACR Cryptol. ePrint Arch..

[11]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[12]  Zuo-Wen Tan,et al.  A Novel Identity-based Group Signature Scheme from Bilinear Maps , 2003 .

[13]  Mark J. Clement,et al.  Performance of finite field arithmetic in an elliptic curve cryptosystem , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[14]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[15]  Xiaofeng Wang,et al.  A New Certificateless Electronic Cash Scheme with Multiple Banks Based on Group Signatures , 2008, 2008 International Symposium on Electronic Commerce and Security.

[16]  Jun Zhong,et al.  A New Type of Group Blind Signature Scheme Based on Bilinear Pairings , 2006, IACR Cryptol. ePrint Arch..

[17]  Kwangjo Kim,et al.  Efficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairings , 2003, ACISP.

[18]  Florian Hess,et al.  Efficient Identity Based Signature Schemes Based on Pairings , 2002, Selected Areas in Cryptography.

[19]  Sébastien Canard,et al.  Divisible E-Cash Systems Can Be Truly Anonymous , 2007, EUROCRYPT.

[20]  C. Popescu,et al.  An Off-line Electronic Cash System Based on Bilinear Pairings , 2007, 2007 14th International Workshop on Systems, Signals and Image Processing and 6th EURASIP Conference focused on Speech and Image Processing, Multimedia Communications and Services.

[21]  Dake He,et al.  An ID-based group signature , 2004, InfoSecu '04.

[22]  David Naccache,et al.  On blind signatures and perfect crimes , 1992, Comput. Secur..