Unlinkable divisible electronic cash

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

Volumn 1975, Issue , 2000, Pages 121-134

  Nakanishi, Toru ^a   Sugiyama, Yuji ^a  

^a OKAYAMA UNIVERSITY   (Japan)

Author keywords

Divisibility; Electronic cash; Group signature; Unlinkability

Indexed keywords

SECURITY OF DATA;

DIVISIBILITY; E-CASH SYSTEMS; GROUP SIGNATURES; LINKABLE; UNLINKABILITY;

ELECTRONIC MONEY;

EID: 84944265063     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44456-4_10     Document Type: Conference Paper

References (13)

1. Pfitzmann, B. and Waidner, M.: How to Break and Repair a "Provably Secure" Untraceable Payment System, Advances in Cryptology - CRYPTO'91, LNCS 576, Springer-Verlag, pp. 338-350 (1992).
2. Okamoto, T.: An Efficient Divisible Electronic Cash Scheme, Advances in Cryptology - CRYPTO'95, LNCS 963, Springer-Verlag, pp. 438-451 (1995).
3. Chan, A., Frankel, Y. and Tsiounis, Y.: Easy Come - Easy Go Divisible Cash, Advances in Cryptology - EUROCRYPT'98, LNCS 1403, Springer-Verlag, pp. 561-575 (1998).
4. Nakanishi, T., Haruna, N. and Sugiyama, Y.: Unlinkable Electronic Coupon Protocol with Anonymity Control, Proc. of Second International Information Security Workshop, ISW'99, LNCS 1729, Springer-Verlag, pp. 37-46 (1999).
5. Fujisaki, E. and Okamoto, T.: Practical Escrow Cash Schemes, IEICE trans. on Fundamentals., Vol. E81-A, No. 1, pp. 11-19 (1998).
6. von Solms, S. and Naccache, D.: On Blind Signatures and Perfect Crimes, Computers and Security, Vol. 11, No. 6, pp. 581-583 (1992).
7. Frankel, Y. D. Y.: Threshold Cryptosystems, Advances in Cryptology - CRYPTO'89, LNCS 435, Springer-Verlag, pp. 307-315 (1990).
8. Camenisch, J. and Stadler, M.: Efficient Group Signature Schemes for Large Groups, Advances in Cryptology - CRYPTO'97, LNCS 1294, Springer-Verlag, pp. 410-424 (1997).
9. Fiat, A. and Shamir, A.: How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology - CRYPTO '86, LNCS 263, Springer-Verlag, pp. 186-194 (1987).
10. Bellare, M. and Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols, Proc. of First Annual Conference on Computer and Communications Security, Association for Computing Machinery, pp. 62-73 (1993).
11. Stadler, M.: Publicly Verifiable Secret Sharing, Advances in Cryptology - EU- ROCRYPT'96, LNCS 1070, Springer-Verlag, pp. 190-199 (1996).
12. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms, Advances in Cryptology - CRYPTO'84, LNCS 196, Springer-Verlag, pp. 10-18 (1985).
13. Chaum, D.: Blind Signatures for Untraceable Payments, Advances in Cryptology: Proceedings of CRYPTO '82, Plenum Press, pp. 199-203 (1983).