An efficient online electronic cash with unlinkable exact payments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3225, Issue , 2004, Pages 367-378

  Nakanishi, Toru ^a   Shiota, Mitsuaki ^a   Sugiyama, Yuji ^a  

^a OKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CUSTOMER SATISFACTION; EFFICIENCY; SECURITY OF DATA;

E-CASH SYSTEMS; EXACT PAYMENTS; INTENSIVE RESEARCH; NETWORK INFRASTRUCTURE; OFFLINE SYSTEMS; ON-LINE E-CASH; PAYMENT PROTOCOL; UNLINKABILITY;

ELECTRONIC MONEY;

EID: 27844514431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30144-8_31     Document Type: Article

References (15)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, "A practical and provably secure coalition-resistant group signature scheme," CRYPTO 2000, LNCS 1880, pp.255-270, 2000.
2. F. Boudot, "Efficient proofs that a committed number lies in an interval," EUROCRYPT 2000, LNCS 1807,pp.431-444, 2000.
3. S. Brands, "Untraceable off-line cash in wallets with observers," CRYPTO '93, LNCS 773, pp.302-318, 1994.
4. E. Brickell, P. Gemmell, and D. Kravitz, "Trustee-based tracing extensions to anonymous cash and the making of anonymous change," SODA '95, pp.457-466, ACM, 1995.
5. J. Camenisch and A. Lysyanskaya, "An efficient system for non-transferable anonymous credentials with optional anonymity revocation," EUROCRYPT 2001, LNCS 2045, pp.93-118, 2001.
6. J. Camenisch and A. Lysyanskaya, "A signature scheme with efficient protocols," SCN '02, LNCS 2576, 2002.
7. J. Camenisch and M. Michels, "Separability and efficiency for generic group signature schemes," CRYPTO '99, LNCS 1666, pp.413-430, 1999.
8. A. Chan, Y. Frankel, and Y. Tsiounis, "Easy come - easy go divisible cash," EUROCRYPT '98, LNCS 1403, pp.561-575, 1998.
9. R. Cramer, I. Damgård, and J.B. Nielsen, "Multiparty computation from threshold homomorphic encryption," EUROCRYPT 2001, LNCS 2045, pp.280-299, 2001.
10. I. Damgård and E. Fujisaki, "A statistically-hiding interger commitment scheme based on groups with hidden order," ASIACRYPT 2002, LNCS 2501, pp.125-142, 2002.
11. I. Damgård and M. Jurik, "A generalisation, a simplification and some applications of paillier's probabilistic public-key system," PKC 2001, LNCS 1992, pp.119-136, 2001.
12. I. Damgård and M. Jurik, "Client/server tradeoffs for online elections," PKC 2002, LNCS 2274, pp.125-140, 2002.
13. G. Davida, Y. Frankel, Y. Tsiounis, and M. Yung, "Anonymity control in e-cash systems," FC '97, LNCS 1318, pp.1-16, 1997.
14. T. Nakanishi and Y. Sugiyama, "Unlinkable divisible electronic cash," ISW 2000, LNCS 1975, pp.121-134, 2000.
15. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," EUROCRYPT '99, LNCS 1592, pp.223-238, 1999.