An efficiency improvement on an unlinkable divisible electronic cash system

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E85-A, Issue 10, 2002, Pages 2326-2335

  Nakanishi, Toru ^a   Sugiyama, Yuji ^a  

^a OKAYAMA UNIVERSITY   (Japan)

Author keywords

Divisibility; Electronic cash system; Group signature scheme; Signatures based on zero knowledge proofs of knowledge; Unlinkability

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA PRIVACY; TREES (MATHEMATICS);

ELECTRONIC CASH SYSTEMS;

ELECTRONIC COMMERCE;

EID: 0036825945     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. T. Nakanishi and Y. Sugiyama, "Unlinkable divisible electronic cash," Proc. Third International Workshop on Information Security (ISW2000), LNCS 1975, pp.121-134, Springer-Verlag, 2000.
2. D. Chaum, "Blind signatures for untraceable payments," Advances in Cryptology: Proceedings of CRYPTO'82, pp.199-203, Plenum Press, 1983.
3. T. Okamoto and K. Ohta, "Universal electronic cash," Advances in Cryptology-CRYPTO'91, LNCS 576, pp.324-337, Springer-Verlag, 1992.
4. S. Brands, "Untraceable off-line cash in wallets with observers," Advances in Cryptology-CRYPTO'93, LNCS 773, pp.302-318, Springer-Verlag, 1994.
5. T. Okamoto, "An efficient divisible electronic cash scheme," Advances in Cryptology-CRYPTO'95, LNCS 963, pp.438-451, Springer-Verlag, 1995.
6. G. Davida, Y. Frankel, Y. Tsiounis, and M. Yung, "Anonymity control in e-cash systems," Proc. First Financial Cryptography Conference (FC'97), LNCS 1318, pp.1-16, Springer-Verlag, 1997.
7. A. Chan, Y. Frankel, and Y. Tsiounis, "Easy come easy go divisible cash," Advances in Cryptology-EUROCRYPT'98, LNCS 1403, pp.561-575, Springer-Verlag, 1998.
8. E. Fujisaki and T. Okamoto, "Practical escrow cash schemes," IEICE Trans. Fundamentals, vol. E81-A, no.1, pp.11-19, Jan. 1998.
9. T. Nakanishi and Y. Sugiyama, "Group signature scheme with signature tracing and its application to an electronic coupon system," Trans. IPS Japan, vol.42, no.8, pp.2030-2039, Aug. 2001.
10. B. Pfitzmann and M. Waidner, "How to break and repair a "provably secure" untraceable payment system," Advances in Cryptology-CRYPTO'91, LNCS 576, pp.338-350, Springer-Verlag, 1992.
11. J. Camenisch and M. Stadler, "Efficient group signature schemes for large groups," Advances in Cryptology-CRYPTO'97, LNCS 1294, pp.410-424, Springer-Verlag, 1997.
12. S. von Solms and D. Naccache, "On blind signatures and perfect crimes," Computers and Security, vol. 11, no.6, pp.581-583, 1992.
13. Y. Desmedt and Y. Frankel, "Threshold cryptosystems," Advances in Cryptology-CRYPTO'89, LNCS 435, pp.307-315, Springer-Verlag, 1990.
14. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems," Advances in Cryptology-CRYPTO'86, LNCS 263, pp.186-194, Springer-Verlag, 1987.
15. M. Bellare and P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols," Proc. First Annual Conference on Computer and Communications Security, pp.62-73, Association for Computing Machinery, 1993.
16. M. Stadler, "Publicly verifiable secret sharing," Advances in Cryptology-EUROCRYPT'96, LNCS 1070, pp.190-199, Springer-Verlag, 1996.
17. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
18. B. Schoenmakers, "An efficient electronic payment system withstanding parallel attacks," Tech. Report CS-R9522, CWI - Centrum voor Wiskunde en Informatica, 1995. avaiable at http://www.win.tue.nl/berry/papers.html.
19. M. Abe and M. Ohkubo, "Provably secure fair blind signatures with tight revocation," Advances in Cryptography ASIACRYPT2001, LNCS 2248, pp.583-601, Springer-Verlag, 2001.