A novel electronic cash system with trustee-based anonymity revocation from pairing

被引:35
作者
Chen, Yalin [2 ]
Chou, Jue-Sam [1 ]
Sun, Hung-Min [2 ]
Cho, Ming-Hsun [1 ]
机构
[1] Nanhua Univ, Dalin Township 62248, Chiayi County, Taiwan
[2] Natl Tsing Hua Univ, Hsinchu, Taiwan
关键词
Anonymity revocation; Bilinear pairing; E-cash; Digital cryptography; Mutual authentication; PARTIALLY BLIND SIGNATURES; SCHEME;
D O I
10.1016/j.elerap.2011.06.002
中图分类号
F [经济];
学科分类号
02 ;
摘要
Untraceable electronic cash is an attractive payment tool for electronic-commerce because its anonymity property can ensure the privacy of payers. However, this anonymity property is easily abused by criminals. In this paper, several recent untraceable e-cash systems are examined. Most of these provide identity revealing only when the e-cash is double spent. Only two of these systems can disclose the identity whenever there is a need, and only these two systems can prevent crime. We propose a novel e-cash system based on identity-based bilinear pairing to create an anonymity revocation function. We construct an identity-based blind signature scheme, in which a bank can blindly sign on a message containing a trustee-approved token that includes the user's identity. On demand, the trustee can disclose the identity for e-cash using only one symmetric operation. Our scheme is the first attempt to incorporate mutual authentication and key agreement into e-cash protocols. This allows the proposed system to attain improvement in communication efficiency when compared to previous works. (C) 2011 Elsevier B. V. All rights reserved.
引用
收藏
页码:673 / 682
页数:10
相关论文
共 26 条
[1]  
Abe M, 2000, LECT NOTES COMPUT SC, V1880, P271
[2]  
[Anonymous], 1995, International Conference on the Theory and Applications of Cryptographic Techniques
[3]  
[Anonymous], 2002012 CRYPT EPRINT
[4]  
[Anonymous], 1994, Advances in Cryptology-CRYPTO' 93, DOI DOI 10.1007/3-540-48329-2_26
[5]   Privacy-preserving e-payments using one-time payment details [J].
Ashrafi, Mafruz Zaman ;
Ng, See Kiong .
COMPUTER STANDARDS & INTERFACES, 2009, 31 (02) :321-328
[6]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[7]  
Brands Stefan., 1995, EURO CRYPT, V921, P231
[8]  
BRICKELL E, 1995, PROCEEDINGS OF THE SIXTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P457
[9]  
CAMENISCH J, 1996, P ESORICS, P33
[10]  
CHAUM D, 1990, LECT NOTES COMPUT SC, V403, P319