A protocol for untraceable electronic cash

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

Volumn 1846, Issue , 2000, Pages 189-197

  Wang, Hua ^a   Zhang, Yanchun ^b  

^a INFORMATION ENGINEERING UNIVERSITY   (China)

^b UNIVERSITY OF SOUTHERN QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT;

DISCRETE LOGARITHMS; NEW PROTOCOL; PAYMENT TRANSACTIONS;

ELECTRONIC MONEY;

EID: 84055163529     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45151-x_18     Document Type: Conference Paper

References (14)

1. D. Chaum. Blind signatures for untraceable payments. Advances in Cryptology. Proc. Crypto’82, pp:199-203.
2. D. Chaum, A. Fiat, and M. Naor. Un traceable electronic cash. In Advances in Cryptology Crypto’88, pp:319-327. Springer-Verlag, 1990.
3. D. Simon. Anonymous communication and anonymous cash. Advances in Cryptology, Proc. of Crypto’96, pp:61-73, Springer-Verlag, 1991.
4. Y. Yacobi. Efficien telectronic money. Advances in Cryptology, Proc. of Asiacrypt’94, pp: 153-163. Springer-Verlag, 1995.
5. T. Okamoto and K. Ohta. Disposable zero-kno wledge authen tication and their applications to untraceable electronic cash. Advances in Cryptology, Proc. of Crypto’89, pp:481-496, Springer-Verlag, 1990.
6. B. Pfitzmann and M. W aidner. How to break and repair a ‘provably secure’ untraceable payment system. Advances in Cryptology, Proc. of Crypto’91, pp:338-350, Springer-Verlag, 1992.
7. M. Franklin and M. Yung. Secure and efficient off-line digital money. In Proc. of the twentieth International Colloquium on Automata, Languages and Programming(ICALP 1993). (Lecture Notes in Computer Science 700), pp: 265-276. Springer-Verlag, 1993.
8. A. Chan, Y. Frankel, and Y. Tsiounis. An efficient off-line electronic cash scheme as secure as RSA. Research report NU-CCS-96-03, Northeastern University, Boston, Massachussets, 1995.
9. T. Okamoto. An efficient divisible electronic cash scheme. Advances in Cryptology. Proc. of Crypto’95, pp:438-451. Springer-Verlag, 1995.
10. Y. Frankel, T. Yiannis and M. Yung. Indirect Discourse Proofs: Achieving Fair Off-Line Electronic Cash. Asiacrypt’96, Lecture Notes in Computer Science 1163, pp: 286-300.
11. T. Yiannis. Fair Off-Line Cash made easy. Asiacrypt’98, Lecture Notes in Computer Science 1346, pp:240-252.
12. T. Yiannis, M. Yung. On the security of ElGamal-based encryption. In 1998 International Workshop on Practice and Theory in Public Key Cryptography (PKC’98), Japan, pp:37-49.
13. M. Bellare and P. Roga way. Random oracles are practical: a paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pp:62-73, 1993.
14. Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21, 2 (Feb. 1978), pp:120–126.