Secure and efficient digital coins

Author

Nguyen, Khanh Quoc ; Mu, Yi ; Varadharajan, Vijay

Author_Institution

Sch. of Comput., Univ. of Western Sydney, Kingswood, NSW, Australia

fYear

1997

fDate

8-12 Dec 1997

Firstpage

9

Lastpage

15

Abstract

Current off-line electronic cash systems require a great number of complex online computations by clients during the payment phase. In this paper, we propose a new off-line anonymous cash scheme that greatly reduces the number of online computations that need to be done by the clients for each payment transaction. In particular, except for the first coin in a transaction, the client only needs to perform minimal computations for the remaining coins in the transaction. Our scheme also provides unconditional client anonymity and is able to detect double-spending and is resistant to coin forgery and framing attacks

Keywords

EFTS; security of data; transaction processing; coin forgery; complex online computations; digital coins; double-spending detection; efficiency; electronic cash systems; framing attacks; off-line anonymous cash scheme; payment phase; payment transactions; security; unconditional client anonymity; Australia; Electronics industry; Forgery; Industrial electronics; Power generation economics; Protection; Security;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Security Applications Conference, 1997. Proceedings., 13th Annual

Conference_Location

San Diego, CA

ISSN

1063-9527

Print_ISBN

0-8186-8274-4

Type

conf

DOI

10.1109/CSAC.1997.646168

Filename

646168