• Articles • Previous Articles    

ID-Based Fair Off-Line Electronic Cash System with Multiple Banks

Chang-Ji Wang{1,2,3, Yong Tang1, and Qing Li1   

  1. 1Department of Computer Science, Sun Yat-Sen University, Guangzhou 510275, China 2Guangdong Province Information Security Key Laboratory, Guangzhou 510275, China 3The State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China
  • Received:2006-05-08 Revised:2007-01-12 Online:2007-05-10 Published:2007-05-10

ID-based public key crypto\-graphy (ID-PKC) has many advantages over certificate-based public key cryptography (CA-PKC), and has drawn researchers' extensive attention in recent years. However, the existing electronic cash schemes are constructed under CA-PKC, and there seems no electronic cash scheme under ID-PKC up to now to the best of our knowledge. It is important to study how to construct electronic cash schemes based on ID-PKC from views on both practical perspective and pure research issue. In this paper, we present a simpler and provably secure ID-based restrictive partially blind signature (RPBS), and then propose an ID-based fair off-line electronic cash (ID-FOLC) scheme with multiple banks based on the proposed ID-based RPBS. The proposed ID-FOLC scheme with multiple banks is more efficient than existing electronic cash schemes with multiple banks based on group blind signature.

Key words: network reliability; acyclic directed network; factoring algorithm; reliability-preserving reduction;

[1] Chaum D. Blind signatures for untraceable payments. In -\it Proc. Crypto'82}, Plenum Press, 1983, pp.199$\sim$203.

[2] Brands S. Untraceable off-line cash in wallets with observers. In -\it Proc. Crypto'93}, Santa Barbara, CA, USA, -\it LNCS} 773, Springer-Verlag, 1993, pp.302$\sim$318.

[3] B von Solms, D Naccache. On blind signatures and perfect crimes. -\it Computers and Security}, 1992, 11(6): 581$\sim$583.

[4] Stadler M, Piveteau J M, Camenisch J. Fair blind signatures. In -\it Proc. EUROCRYPT'95}, St. Malo, France, -\it LNCS} 921, Springer-Verlag, 1995, pp.209$\sim$219.

[5] Frankel Y, Tsiounis Y, Yung M. Indirect discourse proof: Achieving fair off-line e-cash. In -\it Proc. Advances in Cryptology --ASIACRYPT'96}, Kyongju, South Korea, -\it LNCS} 1163, Springer-Verlag, 1996, pp.286$\sim$300.

[6] Frankel Y, Tsiounis Y, Yung M. Fair off-line e-cash made easy. In -\it Proc. Advances in Cryptography --ASIACRYPT'98}, Beijing, China, -\it LNCS} 1514, Springer-Verlag, 1998, pp.257$\sim$270.

[7] Chen X F, Wang C J, Wang Y M. Fair electronic cash based on double signature. -\it Journal of Computer Science and Technology}, 2002, 17(6): 830$\sim$835.

[8] Abe M, Fujisaki E. How to date blind signatures. In -\it Proc. Advances in Cryptology --ASIACRYPT'96}, Kyongju, South Korea, -\it LNCS} 1163, 1996, pp.244$\sim$251.

[9] Abe M, Okamoto T. Provably secure partially blind signatures. In -\it Proc. Advances in Cryptology --Crypto'2000}, Santa Barbara, CA, USA, -\it LNCS} 1880, Springer-Verlag, 2000, pp.271$\sim$286.

[10] Chien H Y, Jan J K, Tseng Y M. RSA-based partially blind signature with low computation. In -\it Proc. the Eighth Int. Conf. Parallel and Distributed Systems}, Kyongju, South Korea, 2001, pp.385$\sim$389.

[11] Chow S M \it et al. \rm Two improved partially blind signature schemes from bilinear pairings. In -\it Proc. 10th Australasian Conf. Information Security and Privacy $($ACISP'2005$)$}, Brisbane, Australia, -\it LNCS} 3574, Springer-Verlag, 2005, pp.316$\sim$328.

[12] Maitland G, Boyd C. A provably secure restrictive partially blind signature. In -\it Proc. the 5th Int. Workshop on Practice and Theory in Public Key Cryptosystems}, Paris, France, -\it LNCS} 2274, Springer-Verlag, 2002. pp.99$\sim$114.

[13] Chen X F, Zhang F G, Liu S L. ID-based restrictive partially blind signatures and applications. -\it Journal of System and Software}, 2007, 80(2): 164$\sim$171.

[14] Chaum D, Heyst V. Group signatures. In -\it Proc. Advances in Cryptology --EUROCRYPT'91}, Brighton, UK, -\it LNCS} 547, Springer-Verlag, 1991, pp.257$\sim$265.

[15] Camenisch J, Stadler M. Efficient group signatures for large groups. In -\it Proc. Crypto'97}, Santa Barbara, CA, USA, -\it LNCS} 1294, Springer-Verlag, 1997, pp.410$\sim$424.

[16] Lysyanskays A, Ramzan Z. Group blind signatures: A scalable solution to electronic cash. In -\it Proc. Financial Cryptography'98}, Anguilla, British West Indies, -\it LNCS} 1465, Springer-Verlag, 1998, pp.184$\sim$197.

[17] Shamir A. Identity-based cryptosystems and signature schemes. In -\it Proc. Advances in Cryptology --CRYPTO'84}, Santa Barbara, CA, USA, -\it LNCS} 196, Springer-Verlag, 1985, pp.47$\sim$53.

[18] Liu S L, Zhang F G, Chen K F. Authenticating tripartite key agreement protocol with pairings. -\it Journal of Computer Science and Technology}, 2004, 19(2): 169$\sim$176.

[19] Pointcheval D, Stern J. Security arguments for digital signatures and blind signatures. -\it Journal of Cryptology: The Journal of the International Association for Cryptologic Research}, 2000, 13(3): 361$\sim$396.
[1] Rui Hou, Ji-Gang WuYawen Chen, Haibo Zhang, Xiu-Feng Sui. Constructing Edge-Colored Graph for Heterogeneous Networks [J]. , 2015, 30(5): 1154-1160.
[2] KONG Fanjia; WANG Guangxing;. Computing the SKT Reliability of Acyclic Directed Networks Using Factoring Method [J]. , 1999, 14(1): 56-63.
[3] Shi Weigeng; Brigitte Servatius;. Analyzing the Reliability of Degradable Networks [J]. , 1993, 8(1): 77-86.
Full text



[1] Zhou Chaochen; Liu Xinxin;. Denote CSP with Temporal Formulas[J]. , 1990, 5(1): 17 -23 .
[2] David Notkin, Fellow, ACM, IEEE. Software, Software Engineering and Software Engineering Research: Some Unconventional Thoughts[J]. , 2009, 24(2): 189 -197 .
[3] Ying Xu, Ming Li, and Tao Jiang. Preface[J]. , 2010, 25(1): 1 -2 .
[4] Zhi-Xiong Chen (陈智雄), Member, CCF, Xiao-Ni Du (杜小妮), and Chen-Huang Wu (吴晨煌), Member, CCF. Pseudo-Randomness of Certain Sequences of k Symbols with Length pq[J]. , 2011, 26(2): 276 -282 .
[5] Yun Liang, Shuo Wang. Performance-Centric Optimization for Racetrack Memory Based Register File on GPUs[J]. , 2016, 31(1): 36 -49 .
[6] Chun-Meng Kang, Lu Wang, Yan-Ning Xu, Xiang-Xu Meng, Yuan-Jie Song. Adaptive Photon Mapping Based on Gradient[J]. , 2016, 31(1): 217 -224 .
[7] Peng-Yi Hao, Yang Xia, Xiao-Xin Li, Sei-ichiro Kamata, Sheng-Yong Chen. Discriminative Histogram Intersection Metric Learning and Its Applications[J]. , 2017, 32(3): 507 -519 .
[8] Peng-Peng Chen, Hai-Long Sun, Yi-Li Fang, Jin-Peng Huai. Collusion-Proof Result Inference in Crowdsourcing[J]. , 2018, 33(2): 351 -365 .
[9] Shi-Qi Lian, Ying Wang, Yin-He Han. DimRouter: A Multi-Mode Router Architecture for Higher Energy-Proportionality of On-Chip Networks[J]. Journal of Computer Science and Technology, 2018, 33(5): 984 -997 .
[10] Yi Zhou, Xiao-Qing Zheng, and Xuan-Jing Huang. Chinese Named Entity Recognition Augmented with Lexicon Memory[J]. Journal of Computer Science and Technology, 0, (): 1 .

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved