loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th Annual Computer Security Applications Conference (ACSAC '97)
Secure and efficient digital coins
San Diego, CA
December 08-December 12
ISBN: 0-8186-8274-4
ASCII Text
x 
 
Khanh Quoc Nguyen, Yi Mu, V. Varadharajan, "Secure and efficient digital coins," Computer Security Applications Conference, Annual, pp. 9, 13th Annual Computer Security Applications Conference (ACSAC '97), 1997.
 
 
BibTex
x
 
@article{ 10.1109/CSAC.1997.646168,
author = {Khanh Quoc Nguyen and Yi Mu and V. Varadharajan},
title = {Secure and efficient digital coins},
journal ={Computer Security Applications Conference, Annual},
volume = {0},
year = {1997},
isbn = {0-8186-8274-4},
pages = {9},
doi = {http://doi.ieeecomputersociety.org/10.1109/CSAC.1997.646168},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Security Applications Conference, Annual
TI - Secure and efficient digital coins
SN - 0-8186-8274-4
SP
EP
A1 - Khanh Quoc Nguyen,
A1 - Yi Mu,
A1 - V. Varadharajan,
PY - 1997
KW - EFTS; digital coins; electronic cash systems; security; efficiency; complex online computations; payment phase; off-line anonymous cash scheme; payment transactions; unconditional client anonymity; double-spending detection; coin forgery; framing attacks
VL - 0
JA - Computer Security Applications Conference, Annual
ER -
 
Khanh Quoc Nguyen, Sch. of Comput., Univ. of Western Sydney, Kingswood, NSW, Australia
Yi Mu, Sch. of Comput., Univ. of Western Sydney, Kingswood, NSW, Australia
V. Varadharajan, Sch. of Comput., Univ. of Western Sydney, Kingswood, NSW, Australia
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.
Index Terms:
EFTS; digital coins; electronic cash systems; security; efficiency; complex online computations; payment phase; off-line anonymous cash scheme; payment transactions; unconditional client anonymity; double-spending detection; coin forgery; framing attacks
Citation:
Khanh Quoc Nguyen, Yi Mu, V. Varadharajan, "Secure and efficient digital coins," acsac, pp.9, 13th Annual Computer Security Applications Conference (ACSAC '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.