Transferable e-cash revisit

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Incorporating the property of transferability into an offline electronic cash (e-cash) system has turned out to be no easy matter. Most of the e-cash systems proposed so far do not provide transferability. Those who support transferability are either inefficient or requiring to be online with the help of a trustee. In this paper we present an efficient offline transferable e-cash system. The computational complexity of our system is as light as a single term e-cash system [13]. Besides, no trustee is involved in the transfer protocol. In addition to it, we propose two e-check systems constructed using similar techniques to our e-cash system. One is as efficient as a single term e-cash system and supports partial unlinkability. The other one provides complete unlinkability with a more complex setting. Copyright © 2005 by International Federation for Information Processing.

Cite

CITATION STYLE

APA

Liu, J. K., Wong, S. H., & Wong, D. S. (2005). Transferable e-cash revisit. In IFIP Advances in Information and Communication Technology (Vol. 181, pp. 171–188). https://doi.org/10.1007/0-387-25660-1_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free